Linear Programming and Network Flows
Description
Condition - Very Good
The item shows wear from consistent use but remains in good condition. It may arrive with damaged packaging or be repackaged.
This work addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. It provides methods for modeling complex problems via effective algorithms on modern computers. The general theory and characteristics of optimization problems are presented, along with effective solution algorithms. The text also explores linear programming and network flows, employing polynomial-time algorithms and various specializations of the simplex method. Includes many numerical examples to illustrate theory and techniques.
Technical Specifications
Shipping & Delivery
Your order is shipped from the USA and delivered to your door in South Africa in 10–20 working days. All items are fully tracked.
Returns & Exchanges
We offer a 30-day return window. If something isn't right, contact our support team and we'll make it right.
