Zero duality gap in surrogate constraint optimization: A concise review of models

被引:8
作者
Alidaee, Bahram [1 ]
机构
[1] Univ Mississippi, Sch Business Adm, University, MS 38677 USA
关键词
Surrogate constraint relaxation; Mathematical programming optimization; Duality gap; GOAL-PROGRAMMING ALGORITHM; ALLOCATION PROBLEM; AGGREGATION; RELAXATION; NETWORK; SEARCH;
D O I
10.1016/j.ejor.2013.04.023
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Surrogate constraint relaxation was proposed in the 1960s as an alternative to the Lagrangian relaxation for solving difficult optimization problems. The duality gap in the surrogate relaxation is always as good as the duality gap in the Lagrangian relaxation. Over the years researchers have proposed procedures to reduce the gap in the surrogate constraint. Our aim is to review models that close the surrogate duality gap. Five research streams that provide procedures with zero duality gap are identified and discussed. In each research stream, we will review major results, discuss limitations, and suggest possible future research opportunities. In addition, relationships between models if they exist, are also discussed. (c) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:241 / 248
页数:8
相关论文
共 82 条
[1]   Surrogate constraint normalization for the set covering problem [J].
Ablanedo-Rosas, Jose H. ;
Rego, Cesar .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 205 (03) :540-551
[2]   Simple and fast surrogate constraint heuristics for the maximum independent set problem [J].
Alidaee, Bahram ;
Kochenberger, Gary ;
Wang, Haibo .
JOURNAL OF HEURISTICS, 2008, 14 (06) :571-585
[3]   On zero duality gap in surrogate constraint optimization: The case of rational-valued functions of constraints [J].
Alidaee, Bahram ;
Wang, Haibo .
APPLIED MATHEMATICAL MODELLING, 2012, 36 (09) :4218-4226
[4]  
Anthonisse J.M., 1973, Zeitschrift fur Operations Research, V17, P167
[5]  
Apostol T.M., 1974, Mathematical Analysis
[6]  
Arrow K. J., 1973, Mathematical Programming, V5, P225, DOI 10.1007/BF01580123
[7]   A SURROGATE CUTTING PLANE ALGORITHM FOR ALL-INTEGER PROGRAMMING [J].
AUSTIN, LM ;
GHANDFOROUSH, P .
COMPUTERS & OPERATIONS RESEARCH, 1985, 12 (03) :241-250
[8]  
Babayev D. A., 1997, INFORMS Journal on Computing, V9, P43, DOI 10.1287/ijoc.9.1.43
[9]  
Babayev D.J., 2008, 2 INT C PROBL CYB IN
[10]   Development of a new approach for deterministic supply chain network design [J].
Bidhandi, Hadi Mohammadi ;
Yusuff, Rosnah Mohd. ;
Ahmad, Megat Mohamad Hamdan Megat ;
Abu Bakar, Mohd Rizam .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (01) :121-128