Use the graphical method to move from vertex to vertex in the feasible region and identify the optimal solution. Implement the Simplex Method, showing the sequence of tableaus and the basic solutions.

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.

An application of the transportation method of linear programming to a production planning problem of a large footwear manufacturer is described. Factors affecting the choice of approach are discussed ...