Refinement of Lagrangian bounds in optimization problems

Computational Mathematics and Mathematical Physics

Volumn 47, Issue 7, 2007, Pages 1101-1107

  Litvinchev, I S ^a  

^a DORODNICYN COMPUTING CENTER   (Russian Federation)

Author keywords

Lagrangian bounds in optimization problems; Optimization problems; Refinement of Lagrangian bounds

Indexed keywords

EID: 34547653773     PISSN: 09655425     EISSN: 15556662     Source Type: Journal    
DOI: 10.1134/S0965542507070032     Document Type: Article

References (16)

1. L. S. Lasdon, Optimization Theory for Large Systems (Macmillan, New York, 1970; Mir, Moscow, 1975).
2. H. Everett, "Generalized Lagrange Multiplier Method for Solving Problems of Optimal Allocation of Resources," Operat. Res. 11, 399-417 (1963).
3. A. M. Geoffrion, "Lagrangian Relaxation and Its Uses in Integer Programming," Math. Progr. Study 2, 82-114 (1974).
4. A. M. Geoffrion and R. McBride, "Lagrangian Relaxation Applied to Capacitated Facility Location Problems," AIIE Trans. 10, 40-47 (1978).
5. M. Guignard and S. Kim, "Lagrangian Decomposition: A Model Yielding Stronger Lagrangian Bounds," Math. Progr. 39, 215-228 (1987).
6. M. Held and R. Karp, "The Travelling Salesman Problem and Minimum Spanning Trees," 18, 1138-1162 (1970).
7. J. E. Beasly, "Lagrangian Relaxation," in Modern Heuristic Techniques in Combinatorial Problems (Blackwell Science, 1993), pp. 243-303.
8. M. L. Fisher, "An Application Oriented Guide to Lagrangian Relaxation," Interfaces 15, 10-21 (1985).
9. M. Guignard, "Lagrangian Relaxation," TOP 11(2), 151-228 (2003).
10. M. Guignard and M. B. Rosenwein, "An Application-Oriented Guide for Designing Langrangian Dual Ascent Algorithms," Europ. J. Operat. Res. 43, 197-205 (1989).
11. C. Lamarechal, "Lagrangian Relaxation," in Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions, Ed. by M. Junger and D. Naddef (Springer, Berlin, 2001), pp. 115-160.
12. J. F. Shapiro, "A Survey of Lagrangian Techniques for Discrete Optimization," Ann. Discrete Math. 5, 113-138 (1974).
13. N. Z. Shor, Minimization of Nondifferentiable Functions and Applications (Naukova Dumka, Kiev, 1979) [in Russian].
14. A. F. Izmailov and M. V. Solodov, Numerical Optimization Methods (Fizmatlit, Moscow, 2003) [in Russian].
15. A. Freville and S. Hanafi, "The Multidimensional 0-1 Knapsack Problem-Bounds and Computational Aspects," Ann. Operat. Res. 139, 195-227 (2005).
16. Interior Point Methods of Mathematical Programming, Ed. by T. Terlaky (Kluwer, Dordrecht, 1996).