The bicriteria bottleneck linear programming problem is studied in this paper. The two criteria considered are concave bottleneck functions, and the feasible region is a non-empty convex polyhedron. It has been establ...
详细信息
Some powerful algorithms for multi-extremal non-convex-constrained optimization problems are based on reducing these multi-dimensional problems to those of one dimension by applying Peano-type space-filling curves map...
详细信息
The global minimization of large-scale partially separable non-convex problems over a bounded polyhedral set using a parallel branch and bound approach is considered. The objective function consists of a separable con...
详细信息
This paper develops two effective methods for solution of the nonlinear and non-convex programming problems of multiple ratio goal models. They are based on Charnes and Cooper's convergence theorem for an associat...
详细信息
This paper develops two effective methods for solution of the nonlinear and non-convex programming problems of multiple ratio goal models. They are based on Charnes and Cooper's convergence theorem for an associated sequence class of linear programs. The Charnes-Cooper results are extended to develop two alternate algorithms and implementations effectively employing new information en route to solution to achieve significant savings in computation time over methods not taking advantage of such information. Possible uses for other applications than the computed examples or for other model classes are also indicated. [ABSTRACT FROM AUTHOR]
Theorems of the alternative, in particular, Gordan and Motzkin type theorems for non-convex functions are presented, based on the Fuchssteiner and König’s extended mini max theorem. As applications of these theo...
详细信息
暂无评论