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

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

Students will learn the foundations of linear programming, properties of optimal solutions and various solution methods for optimizing problems involving a linear objective function and linear ...

See How It Works for details. This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic ...

Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975.) ...

Roth, A. E., U. G. Rothblum, and J. H. Vande Vate. "Stable Matchings, Optimal Assignments, and Linear Programming." Mathematics of Operations Research 18, no. 4 ...