Perold, André. "Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming." SIAM Journal on Control and Optimization 19, no. 1 (1981): 52–63.

Understand how approximation algorithms compute solutions that are guaranteed to be within some constant factor of the optimal solution. Develop a basic understanding of how linear and integer ...

In the classical linear programming problem the behaviour of continuous, nonnegative variables subject to a system of linear inequalities is investigated. One possible generalization of this problem ...