Abstract
Starting with the primal problem, let us
where A is of order (mxn) with rows α1,..., αm and b is an (m x 1) vector with components b1,…,b m . Alternatively, if
are respectively of order (m + n x n) and (m + n x 1), then we may
where X€Rn is now unrestricted. In this formulation Xj ≥ 0, j = l,…,n,\(\bar b - \bar AX0,\) is treated as a structural constraint so that defines a region of feasibleor admissible solutions K ⊂ Rn.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Panik, M.J. (1996). Duality Theory Revisited. In: Panik, M.J. (eds) Linear Programming: Mathematics, Theory and Algorithms. Applied Optimization, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3434-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3434-7_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3436-1
Online ISBN: 978-1-4613-3434-7
eBook Packages: Springer Book Archive