Skip to main content
  • 126 Accesses

Abstract

MOP and CP works efficiently for moderate size problems defined within a well structured environment. However for large size problems defined within complex contexts, this kind of approach has very little interest and it becomes necessary to resort to more flexible decisional approaches. Goal Programming (GP) emerges within this pragmatic line.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

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

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

Ballestero, E., Romero, C. (1998). Satisficing MCDM Approaches: Goal Programming. In: Multiple Criteria Decision Making and its Applications to Economic Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2827-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2827-9_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5053-6

  • Online ISBN: 978-1-4757-2827-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics