Skip to main content

Problems in General Form

  • Chapter
Linear Programming

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 37))

  • 2344 Accesses

Abstract

Up until now, we have always considered our problems to be given in standard folio. However, for real-world problems it is often convenient to formulate problems in the following form:

$$\begin{array}{*{20}{c}}{maximize\,{c^T}x\,} \\ {subject\,to\,a \leqslant Ax leqslant b} \\ {l\, \leqslant \,x\, \leqslant u.} \end{array}$$
(9.1)

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.

Notes

  • Dantzig, G. (1955), ‘Upper bounds, secondary constraints, and block triangularity in linear programming’, Econometrica 23, 174–183. 160

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Robert J. Vanderbei

About this chapter

Cite this chapter

Vanderbei, R.J. (2001). Problems in General Form. In: Linear Programming. International Series in Operations Research & Management Science, vol 37. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5662-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5662-3_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-5664-7

  • Online ISBN: 978-1-4757-5662-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics