Promoting ε-Efficiency in Multiple Objective Programming: Theory, Methodology, and Application

Margaret Wiecek () and Alexander Engau ()
Additional contact information
Margaret Wiecek: Clemson University
Alexander Engau: Clemson University

A chapter in Operations Research Proceedings 2006, 2007, pp 131-131 from Springer

Abstract: Abstract A major goal in any optimization or decision-making process is to identify a single or all best solutions within a set of feasible alternatives. In multiple objective programming (MOP), while it is theoretically possible to identify the complete set of efficient solutions, finding an exact description of this set often turns out to be practically impossible or computationally too expensive. Thus many research efforts during the last thirty years have focused on concepts and procedures for the efficient set approximation.

Date: 2007
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-69995-8_22

Ordering information: This item can be ordered from
http://www.springer.com/9783540699958

DOI: 10.1007/978-3-540-69995-8_22

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().