Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual |
| |
Authors: | Dennis L Bricker |
| |
Institution: | (1) Division of Systems Engineering, University of Iowa, Iowa City, IA, USA |
| |
Abstract: | We consider a class of problems of resource allocation under economies of scale, namely that of minimizing a lower semicontinuous, isotone, and explicitly quasiconcave cost function subject to linear constraints. An important class of algorithms for the linearly constrained minimization of nonconvex cost functions utilize the branch and bound approach, using convex underestimating cost functions to compute the lower bounds.We suggest instead the use of the surrogate dual problem to bound subproblems. We show that the success of the surrogate dual in fathoming subproblems in a branch and bound algorithm may be determined without directly solving the surrogate dual itself, but that a simple test of the feasibility of a certain linear system of inequalities will suffice. This test is interpreted geometrically and used to characterize the extreme points and extreme rays of the optimal value function's level sets.Research partially supported by NSF under grant # ENG77-06555. |
| |
Keywords: | Nonconvex Programming Surrogate Duality Economies of Scale Quasiconcave Costs |
本文献已被 SpringerLink 等数据库收录! |
|