Optimal Solution Set

Milan Hladík
Additional contact information
Milan Hladík: Charles University

Chapter Chapter 8 in Interval Linear Programming and Extensions, 2025, pp 163-187 from Springer

Abstract: Abstract The optimal solution set is the set of all optimal solutions over all realizations of interval entries. Determining this set is a basic yet very challenging problem. Many open questions remain in this area; for example, no simple (closed-form) characterization of the set is known. That is why we also focus on approximation, proposing several inner and outer estimation techniques. Further, we present an algorithm to check whether a given point belongs to the optimal set; due to the NP-hardness of the problem, the method can be exponential for certain LP forms. The last issue discussed is the boundedness of the optimal set of each LP realization (not to be confused with boundedness of the overall optimal set).

Date: 2025
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:spochp:978-3-031-85096-7_8

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

DOI: 10.1007/978-3-031-85096-7_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().