Asymptotic strong duality for bounded integer programming: a logarithmic-exponential dual formulation

Mathematics of Operations Research

Volumn 25, Issue 4, 2000, Pages 625-644

  Sun, Xiaoling ^a   Li, Duan ^b  

^a SHANGHAI UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; BOUNDARY VALUE PROBLEMS; CONFORMAL MAPPING; LAGRANGE MULTIPLIERS; MATHEMATICAL TRANSFORMATIONS; NONLINEAR PROGRAMMING; PERTURBATION TECHNIQUES; SET THEORY; THEOREM PROVING;

ASYMPTOTIC STRONG DUALITY; LOGARITHMIC EXPONENTIAL DUAL FORMULATION; NONLINEAR LAGRANGIAN FUNCTION;

INTEGER PROGRAMMING;

EID: 0034313890     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.25.4.625.12114     Document Type: Article

References (33)

1. Bertsekas, D. P. 1982. Constrained Optimization and Lagrange Multiplier Methods. Academic Press, Boston, MA.
2. Blair, C. E., R. G. Jeroslow. 1982. The value function of an integer program. Math. Programming 23 237-273.
3. Chavatal, V. 1973. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. J. 4 305-337.
4. Fisher, M. L. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27 1-18.
5. Floudas, C. A., P. M. Pardalos. 1996. State of the Art in Global Optimization: Computational Method and Applications. Kluwer, Dordrecht, The Netherlands.
6. Geoffirion, A. M. 1974. Lagrangian relaxation for integer programming. Math. Programming Stud. 2 82-114.
7. Gill, P. E., W. Murray, M. H. Wright. 1981. Practical Optimization. Academic Press, London, U.K.
8. Goh, C. J., X. Q. Yang. 2000. A nonlinear Lagrangian theory for nonconvex optimization. Theory and Applications, Forthcoming.
9. _, _. 1997. A sufficient and necessary condition for nonconvex constrained optimization. Appl. Math. Lett. 10 9-12.
10. Gondran, M. 1970. Programmation entiere non linéaire. R. I. R. O. 5 108-113.
11. Gupta, O. K., A. Ravindran. 1985. Branch-and-bound experiments in convex nonlinear integer programming. Management Sci. 31 1533-1546.
12. Guignard, M., S. Kim. 1993. Lagrangian decomposition: A model yielding stronger Lagrangian relaxation bounds. Math. Programming 33 262-273.
13. Hestenes, M. R. 1969. Multiplier and gradient methods. J. Optim. Theory Appl. 4 303-320.
14. Li, D. 1995. Zero duality gap for a class of nonconvex optimization problems. J. Optim. Theory Appl. 85 309-324.
15. _, X.L. Sun. 2000. Success guarantee of dual search in integer programming: pth power Lagrangian method. J. Global Optim. Forthcoming.
16. _. 1999. Zero duality gap in integer programming: p-norm surrogate constraint method. Oper. Res. Lett. 25 89-96.
17. _, D.J. White. 2000. P-th power Lagrangian method for integer programming. Ann. Oper. Res. Forthcoming.
18. Li, X. S. 1991a. Maximum entropy method in nonlinear programming. Sci. China, Series A 34 1283-1288.
19. _. 1991b. Maximum entropy method in nonlinear minimax problems. Comput. Structural Mech. Appl. 8 85-91.
20. Llewellyn, D. C., J. Ryan. 1993. A primal dual integer programming algorithm. Discrete Appl. Math. 45 262-273.
21. Michelon, P., N. Maculan. 1991. Lagrangian decomposition for integer nonlinear programming with linear constraints. Math. Programming 52 303-313.
22. _, _. 1993. Lagrangian methods for 0-1 quadratic programming. Discrete Appl. Math. 42 257-269.
23. Misra, K. B., U. Sharma. 1991. An efficient algorithm to solve integer-programming problems arising in systemreliability design. IEEE Trans. Reliability 40 81-91.
24. Powell, M. J. D. 1969. A method for nonlinear constraints in minimization problems. R. Fletcher, ed. Optimization. Academic Press, London, 283-298.
25. Rinnoy Kan, A. H. G., G. T. Timmer. 1989. Global optimization. G. L. Nemhauser, A. H. G. Rinnooy Kan, M. J. Todd, eds. Handbook of Operations Research and Management Science 1, Optimization. North-Holland, Amsterdam, The Netherlands.
26. Rockafellar, R. T. 1973. The multiplier method of Hestenes and Powell applied to convex programming. J. Optim. Theory Appl. 12 555-562.
27. Tang, H. W., L. W. Zhang. 1994. Maximum entropy method in convex programming. Chinese Sci. Bull. 39 682-684.
28. Tzafestas, S. G. 1980. Optimization of system reliability: A survey of problems and techniques. Internat. J. Systems Sci. 11 455-486.
29. Sun, X. L., D. Li. 1999. Value-estimation function method for constrained global optimization. J. Optim. Theory Appl. 102 385-409.
30. Williams, H. P. 1996. Duality in mathematics and linear and integer programming. J. Optim. Theory Appl. 90 257-278.
31. Wolsey, L. A. 1981. Integer programming duality: Price functions and sensitivity analysis. Math. Programming 20 173-195.
32. Xu, Z. K. 1997. Local saddle points and convexification for nonconvex optimization problems. J. Optim. Theory Appl. 94 739-746.
33. Yang, X. Q., C. J. Goh. 2000. A nonlinear Lagrangian function for discrete optimization problems. A. Migdalas, A. Pardalos, P. Varbrand, K. Holmqvist, eds. From Local to Global Optimization. Kluwer, The Netherlands, Forthcoming.