Carl G. Looney, Locally Uniformly Quasi-Convex Programming, SIAM Journal on Applied Mathematics, Vol. 28, No. 4 (Jun., 1975), pp. 881-884 ...

This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

Programming theory is treated initially without any assumptions about the functions and with interpretation for production and activity analysis. By proof of a general theorem about optimal and ...

Introduction to the theory and solution methods of linear and nonlinear programming problems, including: linear programming duality, Lagrangian duality, convex programming and Karush-Kuhn-Tucker ...