Zero duality gap in integer programming: P-norm surrogate constraint method

Operations Research Letters

Volumn 25, Issue 2, 1999, Pages 89-96

  Li, Duan ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING; RELAXATION PROCESSES;

DUALITY GAPS; SADDLE POINTS; SURROGATE CONSTRAINT METHODS;

OPERATIONS RESEARCH;

EID: 0032659908     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00039-5     Document Type: Article

References (10)

1. E.F. Beckenbach, R. Bellman, Inequalities, 3rd Printing, Springer, New York, 1971.
2. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27:1981;1-18.
3. Gavish B., Glover F., Pirkul H. Surrogate constraints in integer programming. J. Inform. Optim. Sci. 13:1991;219-228.
4. Geoffrion A.M. Lagrangean relaxation for integer programming. Math. Program. Study. 2:1974;82-114.
5. Greenberg H.J., Pierskalla W.P. Surrogate mathematical programming. Oper. Res. 18:1970;924-939.
6. Karwan M.H., Rardin R.L. Some relationships between Lagrangian and surrogate duality in integer programming. Math. Program. 17:1979;320-334.
7. Karwan M.H., Rardin R.L. Searchability of the composite and multiple surrogate dual functions. Oper. Res. 28:1980;1251-1257.
8. Li D. Zero duality gap for a class of nonconvex optimization problems. J. Optimiz. Theor. Appl. 85:1995;309-324.
9. Luenberger D.G. Quasi-convex programming. SIAM J. Appl. Math. 16:1968;1090-1095.
10. R.G. Parker, R.L. Rardin, Discrete Optimization, Academic Press, Boston, 1988.