Pathways to the Optimal Set in Linear Programming

Nimrod Megiddo

Chapter Chapter 8 in Progress in Mathematical Programming, 1989, pp 131-158 from Springer

Abstract: Abstract This chapter presents continuous paths leading to the set of optimal solutions of a linear programming problem. These paths are derived from the weighted logarithmic barrier function. The defining equations are bilinear and have some nice primal-dual symmetry properties. Extensions to the general linear complementarity problem are indicated.

Keywords: Dual Problem; Linear Programming Problem; Linear Complementarity Problem; Solution Path; Feasible Domain (search for similar items in EconPapers)
Date: 1989
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-1-4613-9617-8_8

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

DOI: 10.1007/978-1-4613-9617-8_8

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