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

An important class of mathematical programming problems is the scheduling of manufacturing and transportation systems. In many cases, the independent variables which describe the manufacturing system ...

The nonlinear programming (NLP) problem with one objective function f and m constraint functions c i, which are continuously differentiable, is defined as follows: In the preceding notation, n is the ...