Introduction to theory and the solution of linear and nonlinear programming problems: including linear programming, duality, the simplex method, lagrangian duality, convex programming and KKT ...

Jonathan Eckstein, Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming, Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 202-226 ...

Second, the conversion to a single-objective optimization problem involves additional constraints. Third, since most real-world goal programming problems involve nonlinear criterion functions, the ...

Contacts Research and Markets Laura Wood, Senior Manager U.S. Fax: 646-607-1907 Fax (outside U.S.): +353-1-481-1716 press@researchandmarkets.com ...