A modified version of Generalized Programming is presented for solving convex programming problems. The procedure uses convenient linear approximations of the gradient of the dual in order to ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback