Key points are not available for this paper at this time.
Introduction. 2. Modeling Linear Programs. 3. Review of Matrix Algebra and Geometry. 4. Duality and Optimality Conditions in LP. 5. Hungarian Method: A Primal-Dual Method for the Assignment Problem. 6. Primal Algorithm for the Transportation Problem. 7. The Simplex Method for General LP. 8. Algorithms for Multiobjective Models. 9. Modeling Integer and Combinatorial Programs. 10. The Branch and Bound Approach. 11. Heuristic Methods for Combinatorial Optimization Problems. 12. Dynamic Programming. 13. Critical Path Methods in Project Management. 14. Nonlinear Programming. Index.
Smith et al. (Fri,) studied this question.