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 ...

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 ...

This is a preview. Log in through your library . Abstract A new bounding procedure for the Quadratic Assignment Problem (QAP) is described which extends the Hungarian method for the Linear Assignment ...

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 ...