Special LP Cases

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

Chapter Chapter 11 in Interval Linear Programming and Extensions, 2025, pp 259-269 from Springer

Abstract: Abstract Real-world LP problems often have some special structure, and mathematically, they follow from a certain model. In this chapter, we focus on three combinatorial problems that can be formulated using linear programming: the transportation problem, network flow problems, and the shortest path problem. We investigate, in particular, the optimal value function, for which we can derive stronger results than for general interval LP problems.

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_11

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

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

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