Abstract
Capacity improvement involves the reduction of the size of the feasible region of an optimization problem without ‘cutting-off’ the optimal solution point(s). Capacity improvement can be used in a branch-and-bound procedure to produce tighter relaxations to subproblems in the enumeration tree. Previous capacity improvement work has concentrated on tightening the simple lower and upper bounds on variables. In this paper, the capacity improvement procedure is generalized to apply toall constraints that form the feasible region. For the minimization of a separable concave function over a bounded polytope, the method of calculating the capacity improvement parameters is very straightforward. Computational results for fixed-charge and quadratic concave minimization problems demonstrate the effectiveness of this procedure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. J. Bell, B. W. Lamar, and C. A. Wallace (1995), Capacity Improvement, Penalties, and the Fixed Charge Transportation Problem, Working Paper, Energy Modelling Research Group, Department of Management, University of Canterbury, Christchurch, New Zealand.
H. P. Benson (1985), A Finite Algorithm for Concave Minimization over a Polyhedron,Naval Research Logistics Quarterly 32, 165–177.
K. M. Bretthauser (1994), A Penalty for Concave Minimization Derived from the Tuy Cutting Plane,Naval Research Logistics 41, 455–463.
K. M. Bretthauser, and A. V. Cabot (1994), A Composite Branch and Bound, Cutting Plane Algorithm for Concave Minimization over a Polytope,Computers and Operations Research 21, 777–785.
A. V. Cabot (1974), Variations on a Cutting Plane Method for Solving Concave Minimization Problems with Linear Constraints,Naval Research Logistics Quarterly 21, 264–274.
J. E. Falk, and K. L. Hoffman (1986), Concave Minimization via Collapsing Polytopes,Operations Research 34, 919–929.
A. M. Geoffrion, and R. E. Marsten (1972), Integer Programming Algorithms: A Framework and State-of-the-Art Survey,Management Science 18, 465–491.
P. Gray (1967), Mixed Integer Programming Algorithm for Site Selection and Other Fixed Charge Problems, Technical Report No. 6, Department of Operations Research, Stanford University, Stanford, CA.
C. D. Heising-Goodman (1981), A Survey of Methodology for the Global Minimization of Concave Functions Subject to Convex Constraints,OMEGA 9, 313–319.
K. L. Hoffman (1981), A Method for Globally Minimizing Concave Functions Over Convex Sets,Mathematical Programming 20, 22–32.
K. L. Hoffman, and M. Padberg (1985), LP-Based Combinatorial Problem Solving,Annals of Operations Research 4, 145–194.
R. Horst (1986), A General Class of Branch-and-Bound Methods in Global Optimization with Some New Approaches for Concave Minimization,Journal of Optimization Theory and Applications 51, 271–291.
R. Horst, and H. Tuy (1993),Global Optimization: Deterministic Approaches, 2nd ed. Springer-Verlag, Berlin.
B. M. Khumawala (1972), An Efficient Branch and Bound Algorithm for the Warehouse Location Problem,Management Science 18, 718–731.
B. W. Lamar (1985), Network Design Algorithms with Applications to Freight Transportation, Ph.D. Dissertation, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA.
B. W. Lamar (1993), An Improved Branch and Bound Algorithm for Minimum Concave Cost Network Flow Problems,Journal of Global Optimization 3, 261–287.
B. W. Lamar (1993), Nonconvex Optimization Over a Polytope Using Generalized Capacity Improvement, presented at the ORSA/TIMS Joint National Meeting, Phoenix, AZ, November.
B. W. Lamar, Y. Sheffi, and W. B. Powell (1990), A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems,Operations Research 38, 704–710.
G. P. McCormick (1972), Attempts to Calculate Global Solution of Problems that May Have Local Minima, in F. A. Lootsma (Ed.),Numerical Methods for Nonlinear Optimization, 201–221, Academic Press, New York.
P. M. Pardalos (1994), On the Passage from Local to Global in Optimization, in J. R. Birge and K. G. Murty (Eds.),Mathematical Programming: State of the Art 1994, 220–247, The University of Michigan Press, Ann Arbor, MI.
P. M. Pardalos, and J. B. Rosen (1986), Methods for Global Concave Minimization: A Bibliographic Survey,SIAM Review 28, 367–379.
P. M. Pardalos, and J. B. Rosen (1987),Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science268, Springer-Verlag, Berlin.
H. S. Ryoo, and N. V. Sahinidis (1993), Global Optimization of Nonconvex NLPs and MINLPs with Applications in Process Design, Technical Report UILU-ENG 93-4023, Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, November.
J. P. Shectman, and N. V. Sahinidis (1995), A Finite Algorithm for Global Minimization of Separable Concave Programs, Working Paper, Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, January.
N. V. Thakur (1990), Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Function over a Polyhedron,Mathematics of Operations Research 16, 390–407.
H. Tuy (1964), Concave Programming under Linear Constraints,Soviet Mathematics 5, 1437–1440.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lamar, B.W. Nonconvex optimization over a polytope using generalized capacity improvement. J Glob Optim 7, 127–142 (1995). https://doi.org/10.1007/BF01097058
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01097058