Face Method

Ping-Qi Pan
Additional contact information
Ping-Qi Pan: Southeast University, Department of Mathematics

Chapter Chapter 22 in Linear Programming Computation, 2014, pp 571-594 from Springer

Abstract: Abstract Like the simplex method, the so-called “face method”, presented in this chapter, also involves pivot choice. However, it does not use elementary but orthogonal transformations to determine a search direction, and generates iterates that are not necessarily vertices, but boundary points. It proceeds from face to face in the feasible region, until reaching an optimal face together with a pair of primal and dual optimal solutions. Therefore, in some sense, the face method may be regarded as a generalization of the simplex method, which proceeds from 0-dimensional face (vertex) to 0-dimensional face (vertex).

Keywords: Methods Face; Optimal Face; Italics; Matrix Face; Algorithms Face (search for similar items in EconPapers)
Date: 2014
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-642-40754-3_22

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

DOI: 10.1007/978-3-642-40754-3_22

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