Picture 1 of 1

Stock photo

Cristina Sernadas Amilcar Sernadas A Mathematical Primer on Linear (Paperback) - Picture 1 of 1

A Mathematical Primer on Linear Optimization by Amilcar Sernadas, Diogo Gomes, Cristina Sernadas (Paperback, 2019)

Rarewaves Outlet (1364422)

98.1% positive feedback

Price:

GBP 20.70

(inclusive of GST)

ApproximatelyS$ 36.22

+ 3.26 shipping

Estimated delivery Wed, 14 May - Mon, 19 May

Returns:

30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Brand New

About this product

Product Information

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.