Convergent Lagrangian and contour cut method for nonlinear integer programming with a quadratic objective function

SIAM Journal on Optimization

Volumn 17, Issue 2, 2006, Pages 372-400

  Li, D ^a   Sun, X L ^b   Wang, F L ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Duality theory; Lagrangian relaxation; Nonlinear integer programming; Objective contour cut; Quadratic integer programming

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

DUALITY THEORY; LAGRANGIAN RELAXATION; NONLINEAR INTEGER PROGRAMMING; OBJECTIVE CONTOUR CUT; QUADRATIC INTEGER PROGRAMMING;

INTEGER PROGRAMMING;

EID: 34249043224     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040606193     Document Type: Article

References (48)

1. J. E. BEASLEY, N. MEADE, AND T.-J. CHANG, An evolutionary heuristic for the index tracking problem, European J. Oper. Res., 148 (2003), pp. 621-643.
2. A. BECK AND M. TEBOULLE, Global optimality conditions for quadratic optimization problems with binary constraints, SIAM J. Optim., 11 (2000), pp. 179-188.
3. D. E. BELL AND J. F. SHAPIRO, A convergent duality theory for integer programming, Oper. Res., 25 (1997), pp. 419-434.
4. H. P. BENSON AND S. S. ERENGUC, An algorithm for concave integer minimization over a polyhedron, Naval Res. Logist., 37 (1990), pp. 515-525.
5. H. P. BENSON, S. S. ERENGUE, AND R. HORST, A note on adopting methods for continuous global optimization to the discrete case, Ann. Oper. Res., 25 (1990), pp. 243-252.
6. D. BIENSTOCK, A computational study of a family of mixed-integer quadratic programming problems, Math. Program., 74 (1996), pp. 121-140.
7. I. M. BOMZE AND G. DANNINGER, A global optimization algorithm for concave quadratic programming problems, SIAM J. Optim., 3 (1993), pp. 826-842.
8. K. M. BRETTHAUER, A. V. CABOT, AND M. A. VENKATARAMANAN, An algorithm and new penalties for concave integer minimization over a polyhedron, Naval Res. Logist., 41 (1994), pp. 435-154.
9. K. M. BRETTHAUER AND B. SHETTY, The nonlinear resource allocation problem, Oper. Res., 43 (1995), pp. 670-683.
10. K. M. BRETTHAUER AND B. SHETTY, A pegging algorithm for the nonlinear resource allocation problem, Comput. Oper. Res., 29 (2002), pp. 505-527.
11. A. V. CABOT AND S. S. ERENGUE, A branch and bound algorithm for solving a class of nonlinear integer programming problems, Naval Res. Logist., 33 (1986), pp. 559-567.
12. M. W. COOPER, The use of dynamic programming for the solution of a class of nonlinear programming problems, Nav. Res. Logist. Quart., 27 (1980), pp. 89-95.
13. M. W. COOPER, Survey of methods of pure nonlinear integer programming, Manage. Sci., 27 (1981), pp. 353-361.
14. G. DANNINGER AND I. M. BOMZE, Using copositivity for global optimality criteria in concave quadratic programming problems, Math. Program., 62 (1993), pp. 575-580.
15. M. DJERDJOUR, K. MATHUR, AND H. M. SALKIN, A surrogate relaxation based algorithm for a general class quadratic multidimensional knapsack problem, Oper. Res. Lett., 7 (1988), pp. 253-258.
16. M. E. DYER AND J. WALKER, Solving the subproblem in the Lagrangian dual of separable discrete programs with linear constraints, Math. Program., 24 (1982), pp. 107-112.
17. M. L. FISHER, The Lagrangian relaxation method for solving integer programming problems, Manage. Sci., 27 (1981), pp. 1-18.
18. M. L. FISHER AND J, F. SHAPIRO, Constructive duality in integer programming, SIAM J. Appl. Math., 27 (1974), pp. 31-52.
19. C. FLOUDAS AND V. VISWESWARAN, Quadratic optimization, in Handbook of Global Optimization, R. Horst and P. M. Pardalos, eds., Kluwer, Dordrecht, 1995, pp. 217-270.
20. A. M. GEOFFRION, Lagrangean relaxation for integer programming, Math. Program. Stud., 2 (1974), pp. 82-114.
21. O. K. GUPTA AND A. RAVINDRAN, Branch-and-bound experiments in convex nonlinear integer programming, Manage. Sci., 31 (1985), pp. 1533-1546.
22. D. HOCHBAUM, A nonlinear knapsack problem, Oper. Res. Lett., 17 (1995), pp. 103-110.
23. N. J. JOBST, M. D. HORNIMAN, C. A. LUCAS, AND G. MITRA, Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints, Quant. Finance, 1 (2001), pp. 489-501.
24. B. KALANTARI AND J. B. ROSEN, An algorithm for global minimization of linearly constrained concave quadratic functions, Math. Oper. Res., 12 (1987), pp. 544-561.
25. F. KORNER, A hybrid method for solving nonlinear knapsack problems, European J. Oper. Res., 38 (1989), pp. 238-241.
26. J. B. LASSERRE, An explicit equivalent positive semidefinite program for nonlinear 0-1 programs, SIAM J. Optim., 12 (2002), pp. 756-769.
27. D. J. LAUGHHUNN, Quadratic binary programming with application to capital-budgeting problems, Oper. Res., 18 (1970), pp. 454-461.
28. C. LEMAŔECHAL AND A. RENAUD, A geometric study of duality gaps, with applications, Math. Program., 90 (2001), pp. 399-427.
29. D. LI AND X. L. SUN, Success guarantee of dual search in integer programming: p-th power Lagrangian method, J. Global Optim., 18 (2000), pp. 235-254.
30. D. LI AND X. L. SUN, Nonlinear Integer Programming, Springer, New York, 2006.
31. D. LI, X. L. SUN, AND J. WANG, Optimal lot solution to cardinality constrained mean-variance formulation for portfolio selection, Math. Finance, (2006), pp. 83-101.
32. D. LI AND D. J. WHITE, pth power Lagrangian method for integer programming, Ann. Oper. Res., 98 (2000), pp. 151-170.
33. H. M. MARKOWITZ, Portfolio Selection: Efficient Diversification of Investment, John Wiley & Sons, New York, 1959.
34. R. E. MARSTEN AND T. L. MORIN, A hybrid approach to discrete mathematical programming, Math. Program., 14 (1978), pp. 21-40.
35. K. MATHUR, H. M. SALKIN, AND B. B. MOHANTY, A note on a general non-linear knapsack problems, Oper. Res. Lett., 5 (1986), pp. 79-81.
36. K. MATHUR, H. M. SALKIN, AND S. MORITO, A branch and search algorithm for a class of nonlinear knapsack problems, Oper. Res. Lett., 2 (1983), pp. 55-60.
37. G. MITRA, K. DARBY-DOWMAN, C. A. LUCAS, AND J. YADEGAR, Linear, integer separable and fuzzy programming problems: A unified approach towards reformulatoin, J. Oper. Res. Soc., 39 (1988), pp. 161-171.
38. R. G. PARKER AND R. L. RARDIN, Discrete Optimization, Academic Press, Boston, 1988.
39. J. B. ROSEN AND P. M. PARDALOS, Global minimization of large-scale constrained concave quadratic problems by separable programming, Math. Program., 34 (1986), pp. 163-174.
40. J. F. SHAPIRO, A survey of Lagrangian techniques for discrete optimization, Ann. Discrete Math., 5 (1979), pp. 113-138.
41. W. F. SHARPE, A simplified model for portfolio analysis, Manage. Sci., 9 (1963), pp. 277-293.
42. W. F. SHARPE, Portfolio Theory and Capital Markets, McGraw-Hill, New York, 1970.
43. J. P. SHECTMAN AND N. V. SAHINIDIS, A finite algorithm for global minimization of separable concave programs, J. Global Optim., 12 (1998), pp. 1-36.
44. X. L. SUN AND D. LI, Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation, Math. Oper. Res., 25 (2000), pp. 625-644.
45. X. L. SUN AND D. LI, New dual formulations in constrained integer programming, in Progress in Optimization, X. Q. Yang, ed., Kluwer, Dordrecht, 2000, pp. 79-91.
46. X. L. SUN AND D. LI, Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems, Optim. Eng., 3 (2002), pp. 53-65.
47. S. S. SYAM, A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals, European J. Oper. Res., 108 (1998), pp. 196-207.
48. V. VISWESWARAN AND C. A. FLOUDAS, New properties and computational improvement of the GOP algorithm for problems with quadratic objective function and constraints, J. Global Optim., 3 (1993), pp. 439-462.