A study of the linear programming problem, including the simplex method, duality, and sensitivity analysis with applications to matrix games, integer programming and networks.
At the level of Linear Programming, V. Chvatal
- Simplex algorithm
- Duality theorem
- Revised simplex method
- Cutting stock problem. This is an excellent application of the revised simplex algorithm.
- General duality scheme and duality theorem
- Approximation of data
- Network simplex method
- Applications of network simplex