A Mathematical Primer on Linear Optimization
Language: English
Published by College Publications, 2019
- Softcover
- New

Seller: Majestic Books, Hounslow, United KingdomMajestic Books
AbeBooks seller since January 19, 2007
Condition: New
US$ 31.61
Quantity: 4 available
Add to basketItem description from seller
Print on Demand pp. 266.
Seller Inventory # 381374425
- Title
- A Mathematical Primer on Linear Optimization
- Author
- Gomes, Diogo; Sernadas, Amilcar; Sernadas, Cristina
- Publisher
- College Publications
- Publication year
- 2019
- Condition
- New
- Binding
- Soft cover
- Language
- English
- ISBN 10
- 1848903154
- ISBN 13
- 9781848903159
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.
"Synopsis" may belong to another edition of this title.
Majestic Books
Hounslow, United Kingdom
AbeBooks seller since January 19, 2007
Shipping rates from United Kingdom to U.S.A.
| Item | 14 to 45 business days | 5 to 10 business days |
|---|---|---|
| First item | US$ 8.58 | US$ 13.01 |
Payment methods
Store description
We specialise in General Interest Books from South Asian countries.
Specialty
Art, Economics, Buddhism, Religion, Sociology, PaintingSeller's business information
BOOKS AND PERIODICALS AGENCY LTD
Unit 4 Alice way,
Hounslow, United Kingdom TW3 3UD
Terms of sale
Returns accepted if you are not satisfied with the Service or Book.
Shipping terms
Best packaging and fast delivery