Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

In earlier papers [Opns. Res. 9, 849-859 (1961), and 11, 863-888 (1963)] the one-dimensional cutting stock problem was discussed as a linear programming problem. There it was shown how the difficulty ...

Students will learn the foundations of linear programming, properties of optimal solutions and various solution methods for optimizing problems involving a linear objective function and linear ...

The problem of locating p maximally dispersed points in a convex space is considered. This problem is formulated as a non-linear programming problem. It is shown that this problem, in a square, is ...