Advertisement

Introduction

Chapter
  • 158 Downloads
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 1)

Abstract

This book is concerned with linear programming, that is the problem of minimizing or maximizing a linear function subject to linear equality or inequalities constraints. The canonical form of this problem is minimize
$$minimize{\text{ }}\begin{array}{*{20}{c}} {{c^T}x} \\ {Ax} \\ {x \geqslant 0} \end{array} = b$$
where A is an m x n matrix, generally of rank m, b is an m dimensional vector and c is an n dimensional vector. This optimization problem appears in numerous applications in diverse areas as transportation and telecommunications involving problems of crew-scheduling, call routing, facilities planning etc.

Keywords

Linear Programming Problem Dimensional Vector Simplex Method Transportation Problem Interior Point Method 
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 1995

Authors and Affiliations

  1. 1.Department of Industrial and Operations EngineeringThe University of MichiganAnn ArborUSA

Personalised recommendations