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.
Frederick Arthur Ficken taught mathematics at New York University. His other books include Linear Transformations and Matrices.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 3,53 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: TextbookRush, Grandview Heights, OH, Estados Unidos de America
Condición: 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. Nº de ref. del artículo: 52988947
Cantidad disponible: 1 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 64. Nº de ref. del artículo: 26372602220
Cantidad disponible: 1 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. pp. 64. Nº de ref. del artículo: 373476019
Cantidad disponible: 1 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. pp. 64. Nº de ref. del artículo: 18372602214
Cantidad disponible: 1 disponibles