Abstract
In this paper, we consider a general family of nonconvex programming problems. All of the objective functions of the problems in this family are identical, but their feasibility regions depend upon a parameter ϑ. This family of problems is called a parametric nonconvex program (PNP). Solving (PNP) means finding an optimal solution for every program in the family. A prototype branch-and-bound algorithm is presented for solving (PNP). By modifying a prototype algorithm for solving a single nonconvex program, this algorithm solves (PNP) in one branch-and-bound search. To implement the algorithm, certain compact partitions and underestimating functions must be formed in an appropriate manner. We present an algorithm for solving a particular (PNP) which implements the prototype algorithm by forming compact partitions and underestimating functions based upon rules given by Falk and Soland. The programs in this (PNP) have the same concave objective function, but their feasibility regions are described by linear constraints with differing right-hand sides. Computational experience with this algorithm is reported for various problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Falk, J. E., andSoland, R. M.,An Algorithm for Separable Nonconvex Programming Problems, Management Science, Vol. 15, pp. 550–569, 1969.
Soland, R. M.,An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints, Management Science, Vol. 17, pp. 759–773, 1971.
Soland, R. M.,Optimal Facility Location with Concave Costs, Operations Research, Vol. 22, pp. 373–382, 1974.
Reeves, G. R.,Global Minimization in Nonconvex All-Quadratic Programming, Management Science, Vol. 22, pp. 76–86, 1975.
McCormick, G. P.,Computability of Global Solutions to Factorable Nonconvex Programs, Part I, Convex Underestimating Problems, Mathematical Programming, Vol. 10, pp. 147–175, 1976.
Horst, R.,An Algorithm for Nonconvex Programming Problems, Mathematical Programming, Vol. 10, pp. 312–321, 1976.
Benson, H. P.,On the Convergence of Two Branch-and-Bound Algorithms for Nonconvex Programming Problems, Journal of Optimization Theory and Applications, Vol. 36, pp. 129–134, 1982.
Marsten, R. E., andMorin, T. L.,Parametric Integer Programming: The Right-Hand-Side Case, Annals of Discrete Mathematics, Vol. 1, pp. 375–390, 1977.
Agin, N.,Optimum Seeking with Branch and Bound, Management Science, Vol. 13, pp. 176–185, 1966.
Lawler, E. L., andWood, D. E.,Branch-and-Bound Methods: A Survey, Operations Research, Vol. 14, pp. 699–719, 1966.
Mitten, L. G.,Branch-and-Bound Methods: General Formulation and Properties, Operations Research, Vol. 18, pp. 24–34, 1970.
Benson, H. P.,Algorithms for Parametric Nonconvex Programming, University of Florida, Center for Econometric and Decision Sciences, Discussion Paper No. 20, 1980.
Boot, J. C. G.,Binding Constraint Procedures of Quadratic Programming, Econometrica, Vol. 31, pp. 464–498, 1963.
Boot, J. C. G.,On Sensitivity Analysis on Convex Quadratic Programming Problems, Operations Research, Vol. 11, pp. 771–786, 1963.
Marsten, R. E.,User's Manual for SEXOP (Subroutines for Experimental Optimization), Massachusetts Institute of Technology, Sloan School of Management, Release 4, 1974.
Falk, J. E., andHoffman, K. R.,A Successive Underestimation Method for Concave Minimization Problems, Mathematics of Operations Research, Vol. 1, pp. 251–259, 1976.
Author information
Authors and Affiliations
Additional information
Communicated by P. L. Yu
The author would like to thank Professors R. M. Soland, T. L. Morin, and P. L. Yu for their helpful comments. Thanks also go to two anonymous reviewers for their useful comments concerning an earlier version of this paper.
Rights and permissions
About this article
Cite this article
Benson, H.P. Algorithms for parametric nonconvex programming. J Optim Theory Appl 38, 319–340 (1982). https://doi.org/10.1007/BF00935342
Issue Date:
DOI: https://doi.org/10.1007/BF00935342