This concise but detailed and thorough treatment discusses the rudiments of the well-known simplex method for solving optimization problems in linear programming. Geared toward undergraduate students, the approach offers sufficient material for readers without a strong background in linear algebra. Many different kinds of problems further enrich the presentation.
The text begins with examinations of the allocation problem, matrix notation for dual problems, feasibility, and theorems on duality and existence. Subsequent chapters address convex sets and boundedness, the prepared problem and boundedness and consistency, optimal points and motivation of the simplex method, and the simplex method and tableaux. The treatment concludes with explorations of the effectiveness of the simplex method and the solution of the dual problem. Two helpful Appendixes offer supplementary material.
"synopsis" may belong to another edition of this title.
Frederick Arthur Ficken taught mathematics at New York University. His other books include Linear Transformations and Matrices.
"About this title" may belong to another edition of this title.
Seller: TextbookRush, Grandview Heights, OH, U.S.A.
Condition: Brand New. Ships SAME or NEXT business day. We Ship to APO/FPO addr. Choose EXPEDITED shipping and receive in 2-5 business days within the United States. See our member profile for customer support contact info. We have an easy return policy. Seller Inventory # 52988947
Quantity: 1 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 64. Seller Inventory # 26372602220
Quantity: 1 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 64. Seller Inventory # 373476019
Quantity: 1 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. pp. 64. Seller Inventory # 18372602214
Quantity: 1 available