Advertisement

Abstract

The general linear programming problem in n variables (structural as well as slack variables) may be stated as follows:
$$\begin{array}{*{20}{c}} {{A_1}{x_1} + {A_2}{x_2} + ... + {A_n}{x_n} = B} \\ {{x_1} \geqslant 0,\;{x_2} \geqslant 0,...,{x_n} \geqslant 0} \\ {{c_1}{x_1} + {c_2}{x_2} + ... + {c_n}{x_n} = f = \max imum} \end{array}$$
(1)
where A 1 , A 2 ,..., A n and B are m-dimensional column vectors the elements of which are the coefficients of the m linear equations (m < n).

Keywords

Basic Solution Preference Function Duality Theorem Slack Variable Simplex Tableau 
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-Verlag/Wien 1974

Authors and Affiliations

  • Sven Danø
    • 1
  1. 1.University of CopenhagenDenmark

Personalised recommendations