158 Linear Programming I: Simplex Method
cgiterations: []
message: 'Optimization terminated.'References and Bibliography
3.1 G. B. Dantzig, Linear Programming and Extensions, Princeton University Press,
Princeton, NJ, 1963.
3.2 W. J. Adams, A. Gewirtz, and L. V. Quintas,Elements of Linear Programming, Van
Nostrand Reinhold, New York, 1969.
3.3 W.W. Garvin,Introduction to Linear Programming, McGraw-Hill, New York, 1960.
3.4 S. I. Gass,Linear Programming: Methods and Applications, 5th ed., McGraw-Hill, New
York, 1985.
3.5 G. Hadley,Linear Programming, Addison-Wesley, Reading, MA, 1962.
3.6 S. Vajda,An Introduction to Linear Programming and the Theory of Games, Wiley, New
York, 1960.
3.7 W. Orchard-Hays,Advanced Linear Programming Computing Techniques, McGraw-Hill,
New York, 1968.
3.8 S. I. Gass,An Illustrated Guide to Linear Programming, McGraw-Hill, New York, 1970.
3.9 M. F. Rubinstein and J. Karagozian, Building design using linear programming,Journal
of the Structural Division, Proceedings of ASCE, Vol. 92, No. ST6, pp. 223−245, Dec.
1966.
3.10 T. Au,Introduction to Systems Engineering: Deterministic Models, Addison-Wesley,
Reading, MA, 1969.
3.11 H. A. Taha,Operations Research: An Introduction, 5th ed., Macmillan, New York, 1992.
3.12 W. F. Stoecker,Design of Thermal Systems, 3rd ed., McGraw-Hill, New York, 1989.
3.13 K. G. Murty,Linear Programming, Wiley, New York, 1983.
3.14 W. L. Winston,Operations Research: Applications and Algorithms, 2nd ed., PWS-Kent,
Boston, 1991.
3.15 R. M. Stark and R. L. Nicholls,Mathematical Foundations for Design: Civil Engineering
Systems, McGraw-Hill, New York, 1972.
3.16 N. Karmarkar, A new polynomial-time algorithm for linear programming,Combinatorica,
Vol. 4, No. 4, pp. 373−395, 1984.
3.17 A. Maass et al., Design of Water Resources Systems, Harvard University Press,
Cambridge, MA, 1962.Review Questions
3.1 Define a line segment inn-dimensional space.
3.2 What happens whenm=nin a (standard) LP problem?
3.3 How many basic solutions can an LP problem have?
3.4 State an LP problem in standard form.
3.5 State four applications of linear programming.
3.6 Why is linear programming important in several types of industries?
3.7 Define the following terms: point, hyperplane, convex set, extreme point.