The Primal Conical Internal LP Algorithm

Paolo d’Alessandro

Chapter Chapter 25 in On Range Space Techniques, Convex Cones, Polyhedra and Optimization in Infinite Dimensions, 2025, pp 413-424 from Springer

Abstract: Abstract We give an account of the primal conical internal method. While the method is primal, it uses, both in an enumerative and in an evolutive manner, the same technique of the dual method to compute the generators of a polyhedral cone, which is the intersection of a linear subspace with the positive cone. Moreover, the method allows to give, in a primal context, a formula for the value of the maximum. It also provides a complete description of the contact polytope and hence of the set of solutions.

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_25

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

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

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 ().