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

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

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

This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic problems that seek optimal ...

If you choose this pathway, you must complete three courses in the Foundations of Data Structures and Algorithms specialization.