Skip to main content
SpringerLink
Log in

Studying properties of Lagrangian bounds for many-to-many assignment problems

  • Optimization Methods
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Lasdon, Optimization Theory for Large Systems (Dover, New York, 2002)

    MATH  Google Scholar 

  2. H. Everett, “Generalized Lagrange Multiplier Method for Solving Problems of Optimal Allocation of Resources,” Oper. Res. 1, 399–417 (1963).

    Article  MathSciNet  Google Scholar 

  3. M. Held and R. Karp, “The Travelling Salesman Problem and Minimum Spanning Trees,” Oper. Res. 18, 1138–1162 (1970).

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Geoffrion, “Lagrangian Relaxation and Its Uses in Integer Programming,” Mathematical Programming Study 2, 82–114 (1974).

    MathSciNet  Google Scholar 

  5. J. Shapiro, “A Survey of Lagrangian Techniques for Discrete Optimization,” Annals of Discrete Mathematics 5, 113–138 (1974).

    Article  Google Scholar 

  6. M. Fisher, “An Application Oriented Guide to Lagrangian Relaxation,” Interfaces 15 (1985).

  7. M. Guignar, “Lagrangian Relaxation,” TOP 11, 151–228 (2003).

    Article  MathSciNet  Google Scholar 

  8. A. Frangioni, “About Lagrangian Methods in Integer Optimization,” Annals of Operations Research 139, 163–169 (2005).

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Freville and S. Hanafi, “The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects,” Annals of Operations Research 139, 195–227 (2005).

    Article  MATH  MathSciNet  Google Scholar 

  10. I. Litvinchev, “Refinement of Lagrangian Bounds in Optimization Problems,” Computational Mathematics and Mathematical Physics 47, 1101–1107 (2007).

    Article  MathSciNet  Google Scholar 

  11. I. Litvinchev and S. Rangel, “Comparing Lagrangian Bounds for a Class of the Generalized Assignment Problems,” Computational Mathematics and Mathematical Physics 48, 739–746 (2008).

    Article  MathSciNet  Google Scholar 

  12. R. Martin, Large Scale Linear and Integer Programming: A Unified Approach. Boston: Kluwer, 1999.

    MATH  Google Scholar 

  13. D. Pentico, “Assignment Problems: A Golden Anniversary Survey,” Eur. J. Operations Research 176, 774–793 (2007).

    Article  MATH  MathSciNet  Google Scholar 

  14. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implemen-Tations (Wiley, New York, 1990).

    Google Scholar 

  15. R. Fourer, M. Gay, and B. Kernighan, AMPL, A Modeling Language for Mathematical Programming (Scientific Press, Massachusetts, 1993).

    Google Scholar 

  16. L. Lorena and M. Narciso, “Relaxation Heuristics for Generalized Assignment Problem,” Eur. J. Operations Research 91, 600–610 (1996).

    Article  MATH  Google Scholar 

  17. M. Narciso and L. Lorena, “Lagrangean/Surrogate Relaxation for Generalized Assignment Problems,” Eur. J. Operations Research 114, 165–177 (1999).

    Article  MATH  Google Scholar 

  18. V. Jeet and E. Kutanoglu, “Lagrangian Relaxation Guided Problem Space Search Heuristics for Generalized Assignment Problems,” Eur. J. Operations Research 182, 1039–1056 (2007).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center Russian Academy of Science, Moscow, Russia

    I. Litvinchev, S. Rangel, M. Mata & J. Saucedo

  2. São Paulo State University, São Paulo, Brazil

    I. Litvinchev, S. Rangel, M. Mata & J. Saucedo

  3. Nuevo Leon State University, Nuevo Leon, Mexico

    I. Litvinchev, S. Rangel, M. Mata & J. Saucedo

Authors
  1. I. Litvinchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Rangel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Mata
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. Saucedo
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © I. Litvinchev, S. Rangel, M. Mata, J. Saucedo, 2009, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2009, No. 3, pp. 34–40.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Litvinchev, I., Rangel, S., Mata, M. et al. Studying properties of Lagrangian bounds for many-to-many assignment problems. J. Comput. Syst. Sci. Int. 48, 363–369 (2009). https://doi.org/10.1134/S1064230709030046

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230709030046

Keywords

Search

Navigation