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 paper considers non-linear programming models in which randomized solutions are allowed. That is, we consider the minimization of the expected value of a non-linear function subject to ...

Linear semi-infinite programming (LSIP) is a branch of optimisation that focuses on problems where a finite number of decision variables is subject to infinitely many linear constraints. This ...

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

Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975.) ...