Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

Fundamental Theorems. Theorem 1 Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function.When Z has an optimal value (maximum or ...

"Stable Matchings, Optimal Assignments, and Linear Programming." Mathematics of Operations Research 18, no. 4 (November 1993): 803–828. Find it at Harvard; About The Author. Alvin E. Roth.