The Simplex Method of Linear Programming

The Simplex Method of Linear Programming

eBook - 2015
Rate this:
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. --Provided by publisher.
Publisher: Mineola, New York : Dover Publications, 2015.
ISBN: 9780486804729
Branch Call Number: EBOOK
Characteristics: data file
1 online resource (64 pages)

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age

Add Age Suitability

There are no ages for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Recommendations

Subject Headings

  Loading...

Find it at SDPL

  Loading...
[]
[]
To Top