Introduction -- Basic properties of linear programs -- The simplex method -- Duality -- Transportation and network flow problems -- Basic properties of solutions and algorithms -- Basic descent methods -- Conjugate direction methods -- Quasi-new methods -- Constrained minimization conditions -- Primal methods -- Penalty and barrier methods -- Dual and cutting plane methods -- Lagrange methods

1. Linear programming
2. Nonlinear programming