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

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

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

This article gives a reformulation of the simplex method for quadratic programming having the advantage of generating tableaux with certain symmetry properties. It is proved that this method gives the ...