Skip to main content

Abstract

Problems with multiple objectives arise in a natural fashion in most disciplines and their solution has been a challenge to researchers for a long time. Despite the considerable variety of techniques developed in Operations Research (OR) to tackle these problems, the complexities of their solution calls for alternative approaches.

“There is nothing more difficult to take in hand, more perilous to conduct, or more uncertain in its success, than to take the lead in the introduction of a new order to things.”

—Niccolo Machiavelli

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Coello Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B. (2002). Basic Concepts. In: Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic Algorithms and Evolutionary Computation, vol 5. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5184-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5184-0_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-5186-4

  • Online ISBN: 978-1-4757-5184-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics