Skip to main content

One-Phase, Two-Phase, and Composite Methods of Linear Programming

  • Chapter
Linear Programming: Mathematics, Theory and Algorithms

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

  • 514 Accesses

Abstract

In this section we shall return to the general primal linear programming problem in standard form set out in Chapter 3, namely

$$\max f = C'Xs.t.$$
$$AX = b,X0$$

with X € 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). One-Phase, Two-Phase, and Composite Methods of Linear Programming. 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_8

Download citation

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

  • 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