A reformulationconvexification approach for solving nonconvex quadratic programming problems
 Hanif D. Sherali,
 Cihan H. Tuncbilek
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
In this paper, we consider the class of linearly constrained nonconvex quadratic programming problems, and present a new approach based on a novel ReformulationLinearization/Convexification Technique. In this approach, a tight linear (or convex) programming relaxation, or outerapproximation to the convex envelope of the objective function over the constrained region, is constructed for the problem by generating new constraints through the process of employing suitable products of constraints and using variable redefinitions. Various such relaxations are considered and analyzed, including ones that retain some useful nonlinear relationships. Efficient solution techniques are then explored for solving these relaxations in order to derive lower and upper bounds on the problem, and appropriate branching/partitioning strategies are used in concert with these bounding techniques to derive a convergent algorithm. Computational results are presented on a set of test problems from the literature to demonstrate the efficiency of the approach. (One of these test problems had not previously been solved to optimality). It is shown that for many problems, the initial relaxation itself produces an optimal solution.
 AlKhayyal, F. A., Falk, J. E. (1983) Jointly Constrained Biconvex Programming. Math, of Oper. Res. 8: pp. 273286
 AlKhayyal, F. A., Larson, C. (1990) Global Minimization of a Quadratic Function Subject to a Bounded Mixed Integer Constraint Set. Annals of Operations Research 25: pp. 169180
 Balas, E. (1975) Nonconvex Quadratic Programming via Generalized Polars. SIAM Journal on Applied Math. 28: pp. 335349
 Benacer, R., PhamDinh, Tao Global Maximization of a Nondefinite Quadratic Function over a Convex Polyhedron. In: HiriartUrruty, J. B. eds. (1986) Fermat Days 85: Mathematics for Optimization. NorthHolland, Amsterdam, pp. 6576
 Bomze, I. M. (1992) Copositivity Conditions for Global Optimality Indefinite Quadratic Programming Problems. Czechoslovak Journal for Operations Research 1: pp. 119
 Fisher, M. L. (1981) The Lagrangian Relaxation Methods for Solving Integer Programming Problems. Management Science 27: pp. 118
 Floudas, C. A., Parsalos, P. M. (1990) A Collection of Test Problems for Constrained Global Optimization Algorithms. SpringerVerlag, Berlin
 Floudas, C. A., Visweswaran, V. (1990) A Global Optimization Algorithm (GOP) for Certain Classes of Nonconvex NLP's1. Theory. Computers and Chemical Engineering 14: pp. 1419
 Floudas, C. A., Visweswaran, V. (1993) A PrimalRelaxed Dual Global Optimization Approach: Theory. JOTA 78: pp. 187225
 Golub, G. H., Loan, C. F. (1989) Matrix Computations. The Johns Hopkins University Press, Baltimore
 Guignard, M., Kim, S. (1987) Lagrangian Decomposition: A Model Yielding Stronger Lagrangian Bounds. Mathematical Programming 39: pp. 215228
 Hansen, P., Jaumard, B., Lu, S. (1991) An Analytical Approach to Global Optimization. Math. Programming 52: pp. 227254
 Kough, P. F., The Indefinite Quadratic Programming Problem,Operations Research 27(3), 516â€“533.
 Larsson, T., Liu, Z. (1989) A Primal Convergence Result for Dual Subgradient Optimization with Applications to Multicommunity Network Flows. Research Report. Department of Mathematics, Linkoping Institute of Technology, Linkoping, Sweden
 Manas, M. (1968) An Algorithm for a Nonconvex Programming Problem. Econ Math Obzor Acad. Nad. Ceskoslov 4: pp. 202212
 Meyer, G. G. (1988) Convergence of Relaxation Algorithms by Averaging. Mathematical Programming 40: pp. 205212
 Mueller, R. K. (1970) A Method for Solving the Indefinite Quadratic Programming Problem. Management Science 16: pp. 333339
 Murtagh, B. A., Saunders, M. A. (1987) MINOS 5.1 User's Guide. Technical Report Sol 8320R. Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, California
 Muu, L. D., Oettli, W. (1991) An Algorithm for Indefinite Quadratic Programming with Convex Constraints. Operations Research Letters 10: pp. 323327
 Pardalos, P. M. (1991) Global Optimization Algorithms for Linearly Constrained Indefinite Quadratic Programs. Computers Math. Applic. 21: pp. 8797
 Pardalos, P. M., Glick, J. H., Rosen, J. B. (1987) Global Minimization of Indefinite Quadratic Problems. Computing 39: pp. 281291
 Pardalos, P. M., Rosen, J. B. (1987) Constrained Global Optimization: Algorithms and Applications. SpringerVerlag, Berlin
 Pardalos, P. M., Vavasis, S. A. (1991) Quadratic Programming with One Negative Eigenvalue Is NPHard. Journal of Global Optimization 1: pp. 1522
 Phillips, A. T., Rosen, J. B. (1990) GuaranteedÉ›Approximate Solution for Indefinite Quadratic Global Minimization. Naval Research Logistics 37: pp. 499514
 Ritter, K. (1966) A Method for Solving Maximum Problems with a Nonconcave Quadratic Objective Function. Z. Wahrscheinlichkeitstheorie 4: pp. 340351
 Sherali, H. D., Alameddine, A. R. (1992) A New ReformulationLinearization Technique for Bilinear Programming Problems. Journal of Global Optimization 2: pp. 379410
 Sherali, H. D., Myers, D. C. (1985/6) The Design of Branch and Bound Algorithms for a Class of Nonlinear Integer Programs. Annals of Oper. Res. 5: pp. 463484
 Sherali, H. D., Tuncbilek, C. H. (1992) A Global Optimization Algorithm for Polynomial Programming Problems Using a ReformulationLinearization Technique. The Journal of Global Optimization 2: pp. 101112
 Sherali, H. D., Ulular, O. (1989) A PrimalDual Conjugate Subgradient Algorithm for Specially Structured Linear and Convex Programming Problems. Appl. Math. Optim. 20: pp. 193221
 Tuncbilek, C. H. (1994),Polynomial and Indefinite Quadratic Programming Problems: Algorithms and Applications, PhD Dissertation, Industrial and Systems Engineering, Virginia Polytechnic Institute and State University.
 Tuy, H. (1987) Global Minimization of a Difference of Two Convex Functions. Mathematical Programming Study 30: pp. 150182
 Vavasis, S. A. (1992) Approximation Algorithms for Indefinite Quadratic Programming. Mathematical Programming 57: pp. 279311
 Visweswaran, V., Floudas, C. A. (1993) New Properties and Computational Improvement of the GOP Algorithm for Problems with Quadratic Objective Function and Constraints. Journal of Global Optimization 3: pp. 439462
 Zwart, P. B. (1973) Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms. Operations Research 21: pp. 12601266
 Title
 A reformulationconvexification approach for solving nonconvex quadratic programming problems
 Journal

Journal of Global Optimization
Volume 7, Issue 1 , pp 131
 Cover Date
 19950701
 DOI
 10.1007/BF01100203
 Print ISSN
 09255001
 Online ISSN
 15732916
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 Quadratic programming
 indefinite quadratic problems
 reformulationlinearization technique
 reformulationconvexification approach
 outerapproximations
 tight linear programming relaxations
 Industry Sectors
 Authors

 Hanif D. Sherali ^{(1)}
 Cihan H. Tuncbilek ^{(1)}
 Author Affiliations

 1. Department of Industrial and Systems Engineering Virginia Polytechnic Institute and State University Blacksburg, 240610118, Virginia, USA