Transactions of the American Mathematical Society, Vol. 192 (May, 1974), pp. 285-292 (8 pages) The closed convex hull and extreme points are obtained for the functions which are convex, starlike, and ...

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 ...