Pseudo-Concave Programming and Lagrange Regularity. - Kenneth O. Kortanek; J. P. Evans (Oper. Res., 1967)

Letter to the Editor - A Note on Some Classical Methods in Constrained Optimization and Positively Bounded Jacobians. - Kenneth O. Kortanek; Robert G. Jeroslow (Oper. Res., 1967)

Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification. - Kenneth O. Kortanek; J. P. Evans (Oper. Res., 1968)

Classification Schemes for the Strong Duality of Linear Programming Over Cones. - Kenneth O. Kortanek; Walter O. Rom (Oper. Res., 1971)

On Refinements of Some Duality Theorems in Linear Programming over Cones. - Kenneth O. Kortanek; Allen L. Soyster (Oper. Res., 1972)

Solution Sets of Convex Programs Related to Chemical Equilibrium Problems. - Kenneth O. Kortanek; Walter O. Rom; Allen L. Soyster (Oper. Res., 1973)

Separably-infinite programs. - Abraham Charnes; Paul R. Gribik; Kenneth O. Kortanek (Z. Oper. Research, 1980)

Polyextremal principles and separably-infinite programs. - Abraham Charnes; Paul R. Gribik; Kenneth O. Kortanek (Z. Oper. Research, 1980)

Semi-Infinite Programming and Applications. - Sven-Åke Gustafson; Kenneth O. Kortanek (ISMP, 1982)

On extreme points of bounded sets of generalized finite sequence spaces. - Kenneth O. Kortanek; H. M. Strojwas (Z. Oper. Research, 1983)

Network design and dynamic routing under queueing demand. - Kenneth O. Kortanek; George G. Polak (Z. Oper. Research, 1985)

On constraint sets of infinite linear programs over ordered fields. - Kenneth O. Kortanek; H. M. Strojwas (Math. Program., 1985)

A note on a potential reduction algorithm for LP with simultaneous primal-dual updating. - S. Huang; Kenneth O. Kortanek (Oper. Res. Lett., 1991)

Semi-infinite programming duality for order restricted statistical inference models. - Kenneth O. Kortanek (ZOR Methods Model. Oper. Res., 1993)

A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems. - Kenneth O. Kortanek; Jishan Zhu (Math. Oper. Res., 1993)

Near boundary behavior of primal-dual potential reduction algorithms for linear programming. - Yinyu Ye 001; Kenneth O. Kortanek; John A. Kaliski; S. Huang (Math. Program., 1993)

A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems. - Kenneth O. Kortanek; Hoon No (SIAM J. Optim., 1993)

Semi-Infinite Programming: Theory, Methods, and Applications. - Rainer Hettich; Kenneth O. Kortanek (SIAM Rev., 1993)

Vector-Supercomputer Experiments with the Primal Affine Linear Programming Scaling Algorithm. - Kenneth O. Kortanek (SIAM J. Sci. Comput., 1993)

Discrete Infinite Transportation Problems. - Kenneth O. Kortanek; Maretsugu Yamasaki (Discret. Appl. Math., 1995)

Design of signal-adapted FIR paraunitary filter banks. - Pierre Moulin; Mihai Anitescu; Kenneth O. Kortanek; Florian A. Potra (ICASSP, 1996)

An infeasible interior-point algorithm for solving primal and dual geometric programs. - Kenneth O. Kortanek; Xiaojie Xu; Yinyu Ye 001 (Math. Program., 1996)

Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach. - Dennis L. Bricker; Kenneth O. Kortanek; Lina Xu (Adv. Decis. Sci., 1997)

The role of linear semi-infinite programming in signal-adapted QMF bank design. - Pierre Moulin; Mihai Anitescu; Kenneth O. Kortanek; Florian A. Potra (IEEE Trans. Signal Process., 1997)

Perfect duality in semi-infinite and semidefinite programming. - Kenneth O. Kortanek; Qinghong Zhang (Math. Program., 2001)

Semi-infinite Programming and Applications in Finance. - Kenneth O. Kortanek; Vladimir G. Medvedev (Encyclopedia of Optimization, 2009)

Semi-infinite Programming, Semidefinite Programming and Perfect Duality. - Kenneth O. Kortanek; Qinghong Zhang (Encyclopedia of Optimization, 2009)

Perfect Duality in Solving Geometric Programming Problems Under Uncertainty. - Dennis L. Bricker; Kenneth O. Kortanek (J. Optim. Theory Appl., 2017)

On a Compound Duality Classification for Geometric Programming. - Qinghong Zhang; Kenneth O. Kortanek (J. Optim. Theory Appl., 2019)

Strong duality for standard convex programs. - Kenneth O. Kortanek; Guolin Yu; Qinghong Zhang (Math. Methods Oper. Res., 2021)