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

  • 5 - The Simplex Algorithm

  • 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 185-241

  • Summary

    In this chapter, we introduce the simplex algorithm for solving linear programming problems. We confine the chapter to Phase II pivoting, which is valid for any standard form maximization problem. We handle standard form minimization problems by using duality, since the dual problem of a standard form minimization problem is a standard form maximization problem. Since all linear programming problems that arise in game theory are standard form, the material of this chapter is sufficent to study game theory. Phase I pivoting, which is used for problems with mixed constraints, and integer programming are deferred until a later chapter, after we explore game theory. We end the chapter with a section on using software packages such as Microsoft Excel and Wolfram Mathematica to solve linear programming problems.