Abstract
The general linear programming problem can be formulated as follows: minimize the function
under the conditions
,
where \( {c^j},{b^i},{a_{ij}},i = \overline {1,s} ,j = \overline {1,n} \) are given numbers, I + is the given subset of indices from the set {1,2,... , n}. The function (1.1.1) is known as an objective function, conditions (1.1.3) are constraints of the type of inequalities, conditions (1.1.4) are constraints of the type of equalities. Conditions (1.1.2) of nonnegativity of the variables are, of course, also constraints of the type of inequalities, but it is customary to consider them separately. Problem (1.1.1)-(1.1.4) may include cases where \( {I_ + } = \emptyset or{I_ + } = \{ 1,2,...,n\} \) it is also possible that problem (1.1.1)-(1.1.4) may not contain constraints of the type of inequalities or equalities. We call the point x = (x 1, ..., x n) which satisfies all conditions (1.1.2)–(1.1.4) an admissible point of problem (1.1.1)–(1.1.4) or simply an admissible point.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Vasilyev, F.P., Ivanitskiy, A.Y. (2001). Simplex Method. In: In-Depth Analysis of Linear Programming. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9759-3_1
Download citation
DOI: https://doi.org/10.1007/978-94-015-9759-3_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5851-5
Online ISBN: 978-94-015-9759-3
eBook Packages: Springer Book Archive