A nonconvex max‐min problem
暂无分享,去创建一个
Abstract : An algorithm designed to solve a large class of nonconvex max-min problems is described. Its usefullness and applicability is demonstrated by solving an extension of a recently introduced model which optimally allocates strategic weapon systems. The extended model is shown to be equivalent to a nonconvex mathematical program with an infinite number of constraints, and hence is not solvable by conventional procedures. An example is worked out in detail to illustrate the algorithm.
[1] Kenneth D. Shere,et al. Allocation of resources to offensive strategic weapon systems , 1976 .
[2] J. E. Falk,et al. Infinitely constrained optimization problems , 1976 .