D-Reduced Simplex Method

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

Chapter Chapter 17 in Linear Programming Computation, 2014, pp 409-440 from Springer

Abstract: Abstract Consider the so-called “D-reduced problem” (25.3), i.e., 17.1 min c T x , s . t . Ax = e r , x ≥ 0. $$\displaystyle{ \begin{array}{ll} \min &{c}^{\mathrm{T}}x, \\ \mathrm{s.t.}&Ax = e_{r},\quad x \geq 0.\\ \end{array} }$$ The associated dual problem is of an objective function involving a single variable. A so-called “D-reduced simplex method” will be developed to solve the preceding problem.

Keywords: Dual Feasibility; Basic Optimal Solution; Primal Feasibility; Simplex Tableau; Auxiliary Program (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_17

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

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

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