A schematic, numerical representation which displays the transformed data set associated with a basic solution to a linear-programming problem. For the problem: Minimize cx,v subject to Axv = b, xv ≥ 0, if we let the m × m matrix Bv be a feasible basis and the m × 1 row vector c 0 be the ordered cost coefficients for the variables in the basis, then the simplex tableau displays the following information in an (m + 1) × (n + 1) rectangular array
where π, the pricing vector, is equal to cv0 Bv−1. The last or (m+ 1)st, row of the tableau contains the reduced costs and the current value of the objective function, respectively. If the simplex method is in Phase I, then an additional row is added to the tableau which contains the reduced costs associated with the artificial basis. In some arrangements of the tableau, the rows associated with the reduced costs are given at the top of the tableau; also, a reduced tableau is obtained by leaving out the columns that correspond to the columns...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Simplex tableau . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_955
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_955
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive