Skip to main content
SpringerLink
Log in

Multi-objective Integer Linear Programming

MOILP

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Generation of E(P)

  Klein–Hannan Method

  Kiziltan–Yucaoglu Method

Interactive Methods

  Gonzalez–Reeves–Franz Algorithm

  Steuer–Choo Method

  The MOMIX Method

See also

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bowman VJ Jr (1976) On the relationship of the Tchebycheff norm of the efficient frontier of multi-criteria objectives. In: Thiriez H, Zionts S (eds) Multiple Criteria Decision Making. Springer, Berlin, pp 76–85

    Google Scholar 

  2. Burkard RE (1981) A relationship between optimality and efficiency in multiple criteria 0–1 programming problems. Comput Oper Res 8:241–247

    Article  Google Scholar 

  3. Gonzalez JJ, Reeves GR, Franz LS (1985) An interactive procedure for solving multiple objective integer Linear programming problems. In: Haimes Y, Chankong V (eds) Decision Making with Multiple Objectives. Springer, Berlin, pp 250–260

    Google Scholar 

  4. Kiziltan G, Yucaoglu E (1983) An algorithm for multiobjective zero-one linear programming. Managem Sci 29(12):1444–1453

    MathSciNet  MATH  Google Scholar 

  5. Klein D, Hannan E (1982) An algorithm for the multiple objective integer linear programming. EJOR 9(4):378–385

    Article  MathSciNet  MATH  Google Scholar 

  6. L'Hoir H, Teghem J (1995) Portfolio selection by MOLP using an interactive branch and bound. Found Computing and Decision Sci 20(3):175–185

    MATH  Google Scholar 

  7. Marcotte O, Soland R (1986) An interactive branch and bound algorithm for multiple criteria optimization. Managem Sci 32(1):61–75

    MathSciNet  MATH  Google Scholar 

  8. Steuer RE (1986) Multiple criteria optimization theory, computation and applications. Wiley, New York

    Google Scholar 

  9. Steuer RE, Choo E-U (1983) An interactive method weighted Tchebycheff procedure for multiple objective programming. Math Program 26:326–344

    Article  MathSciNet  MATH  Google Scholar 

  10. Teghem J, Kunsch P (1986) Interactive method for multi-objective integer linear programming. In: Fandel G, et al. (eds) Large Scale Modelling and Interactive decision analysis. Springer, Berlin 75–87

    Google Scholar 

  11. Teghem J, Kunsch P (1986) A survey of techniques for finding efficient solutions to multi-objective integer linear programming. Asia–Pacific J Oper Res 3:1195–106

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lab. Math. & Operational Research Fac., Polytechn. Mons, Mons, Belgium

    Jacques Teghem

Authors
  1. Jacques Teghem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Teghem, J. (2008). Multi-objective Integer Linear Programming . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_420

Download citation

Publish with us

Policies and ethics

Search

Navigation