Bases and Basic Solutions of Linear Programs

  • Michel Sakarovitch
Part of the Springer Texts in Electrical Engineering book series (STELE)

Abstract

In this brief chapter, we introduce some fundamental concepts in linear programming: bases, basic solutions, canonical form associated with a given basis, feasible basis, optimal basis. These notions are a key to the understanding of the simplex algorithm.

Keywords

Canonical Form Basic Solution Optimal Basis Simplex Algorithm Inconsis Tent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1983

Authors and Affiliations

  • Michel Sakarovitch
    • 1
  1. 1.Laboratoire I.M.A.G.Université Scientifique et Medicale de GrenobleGrenoble CedexFrance

Personalised recommendations