Linear Programming in Finite Dimension

Paolo d’Alessandro

Chapter Chapter 24 in On Range Space Techniques, Convex Cones, Polyhedra and Optimization in Infinite Dimensions, 2025, pp 401-411 from Springer

Abstract: Abstract In this chapter we give an account of two range space linear programming methods: the dual conical method and the primal external method.

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_24

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

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

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