Feasibility and Beacon Points

Paolo d’Alessandro

Chapter Chapter 20 in On Range Space Techniques, Convex Cones, Polyhedra and Optimization in Infinite Dimensions, 2025, pp 309-335 from Springer

Abstract: Abstract We completely solve in the range space the feasibility problem and determine the structure of the slack set, in all three cases, namely strict tangent, internal, and external cases and then draw the consequences for the domain space. We show that in the range space the slack set is a g-polytope in the strictly tangent case and a flat bottom cup in all other cases. We conclude further developing in Hilbert spaces the theory of flat bottom cups, which we initiated in lcs.

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:sprchp:978-3-031-92477-4_20

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

DOI: 10.1007/978-3-031-92477-4_20

Access Statistics for this chapter

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