Skip to main content

Part of the book series: Applied Optimization ((APOP,volume 2))

  • 513 Accesses

Abstract

Starting with the primal problem, let us

$$ \begin{gathered} maxf(X) = C'X\quad s.t. \hfill \\ AX \leqq b, X \geqq 0, X\varepsilon {{R}^{n}}, \hfill \\ \end{gathered} $$

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

$$\bar A = \left[ {\begin{array}{*{20}{c}}A\\\ldots \\{ - {I_n}}\end{array}} \right],\bar b = \left[ {\begin{array}{*{20}{c}}b\\\ldots \\0\end{array}} \right]$$

are respectively of order (m + n x n) and (m + n x 1), then we may

$$\max f\left( x \right) = C'Xs.t.$$
$$\bar b - \bar AX0,$$

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics