Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 3 - Graphical Linear Programming

  • David C. Vella, Skidmore College, New York
  • Book:
    Invitation to Linear Programming and Game Theory
    Published online:
    11 March 2021
    Print publication:
    11 March 2021, pp 102-147

  • Summary

    In this chapter, we introduce linear programming. We start with a simple algebra problem that can be modeled as a system of equations. However, that problem has no solution, so we modify the model to make it more realistic. The result is a standard form linear programming problem. This shows how linear programming arises naturally from the modeling process. Next, we show how to solve these problems in the case when there are two decision variables by the standad graphical technique, which we call graphing in the decision space. This leads naturally to a discussion of the corner point theorem. Finally, we exhibit an alternate graphical approach to solving these problems in the case when there are just two constraints but an arbitrary number of decision variables. We call this method graphing in the constraint space. This technique is a feature of this text; it is not covered in most texts. It is based on linear combinations of vectors in a plane and basic solutions to systems of linear equations, and it sets the stage for the simplex algorithm in Chapter 5.