Skip to main content

Computational Aspects of Linear Programming: Selected Transformations

  • Chapter
Linear Programming: Mathematics, Theory and Algorithms

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

  • 511 Accesses

Abstract

In this chapter our efforts will be directed towards solving a variety of linear programming problems which do not exactly fit the basic structure of the general problem considered in earlier chapters, i.e., a problem of the form

$$\min f\left( x \right) = C'Xs.t.$$
$$AXb,X0.$$

.

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). Computational Aspects of Linear Programming: Selected Transformations. 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_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3434-7_9

  • 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