A Mathematical Primer on Linear Optimization
Diogo Gomes
Sold by THE SAINT BOOKSTORE, Southport, United Kingdom
AbeBooks Seller since 14 June 2006
New - Soft cover
Condition: New
Quantity: Over 20 available
Add to basketSold by THE SAINT BOOKSTORE, Southport, United Kingdom
AbeBooks Seller since 14 June 2006
Condition: New
Quantity: Over 20 available
Add to basketThis item is printed on demand. New copy - Usually dispatched within 5-9 working days 185.
Seller Inventory # C9781848903159
The book provides a self-contained mathematical introduction to linear optimization for undergraduate students of Mathematics. This book is equally suitable for Science, Engineering, and Economics students who are interested in gaining a deeper understanding of the mathematical aspects of the subject. The linear optimization problem is analyzed from different perspectives: topological, algebraic, geometrical, logical, and algorithmic. Nevertheless, no previous knowledge of these subjects is required. The essential details are always provided in a special section at the end of each chapter. The technical material is illustrated with multiple examples, problems with fully-worked solutions, and a range of proposed exercises.
In Chapter 1, several formulations of the linear optimization problem are presented and related concerning admissible vectors and optimizers. Then, sufficient conditions for the existence of optimizers based on topological techniques are discussed in Chapter 2. The main objective of Chapter 3 is to provide a way for deciding whether or not an admissible vector is an optimizer, relying on Farkas' Lemma. In Chapter 4, linear algebra is used for computing optimizers via basic admissible vectors. A geometrical characterization of these vectors is the goal of Chapter 5. Duality is discussed in Chapter 6, giving yet a new technique for finding optimizers. An introduction to computational complexity is presented in Chapter 7 with the aim to analyze the efficiency of linear optimization algorithms. The complexity of a brute-force algorithm is shown not to be polynomial. Chapter 8 is targeted at the Simplex Algorithm. It includes the proof of its soundness and completeness and an explanation on its non-polynomial complexity. Finally, Chapter 9 concentrates on the integer optimization problem with an emphasis on totally unimodularity. An algorithm based on the Branch and Bound Technique is analyzed.
"About this title" may belong to another edition of this title.
Please order through the Abebooks checkout. We only take orders through Abebooks - We don't take direct orders by email or phone.
Refunds or Returns: A full refund of the purchase price will be given if returned within 30 days in undamaged condition.
As a seller on abebooks we adhere to the terms explained at http://www.abebooks.co.uk/docs/HelpCentral/buyerIndex.shtml - if you require further assistance please email us at orders@thesaintbookstore.co.uk
Most orders usually ship within 1-3 business days, but some can take up to 7 days.
| Order quantity | 7 to 28 business days | 7 to 28 business days |
|---|---|---|
| First item | £ 12.60 | £ 14.60 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.