Skip to main content

Linear Programming

  • Chapter
  • 159 Accesses

Abstract

We saw in Chapter 7 how it is possible to find the maximum of a given function when there are constraints on the values which some or all of the variables can assume. To do this we made use of the differential calculus and the method of Lagrangian multipliers. This is, however, only applicable when the constraint is in the form of an equality, that is, one which must be exactly met.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Copyright information

© 1992 K. Holden and A. W. Pearson

About this chapter

Cite this chapter

Holden, K., Pearson, A.W. (1992). Linear Programming. In: Introductory Mathematics for Economics and Business. Palgrave, London. https://doi.org/10.1007/978-1-349-22357-2_8

Download citation

Publish with us

Policies and ethics