Convexity and Optimization – Part II

Review
:

( 0 )

166 pages

Language:

English

This book presents the mathematical basis for linear and convex optimization with an emphasis on the important concept of duality. The simplex algorithm is also described in detail.

Latest Addition

About the author

Get ahead at work with our collection of personal development eBooks

Get access to 1,700+ of eBooks on soft skills and professional efficiency, from communicating effectively over Excel and Outlook, to project management and how to deal with difficult people.

- Written by industry-leading experts
- Bite-sized format (1-2hr reading time)
- Easy-to-use and accessible eReader
- Continue reading from where you stopped
- New eBooks added every week

Free 30-day trial
Then $5.99/mo. Cancel at any time.

Description

Content

This book, the second in a series of three on Convexity and Optimization, presents classical mathematical results for linear and convex optimization with an emphasis on the important concept of duality. Equivalent ways of formulating an optimization problem are presented, the Lagrange function and the dual problem are introduced, and conditions for strong duality are given. The general results are then specialized to the linear case, i.e. to linear programming, and the simplex algorithm is described in detail.

- Optimization
- Optimization problems
- Classification of optimization problems
- Equivalent problem formulations
- Some model examples

- The Lagrange function
- The Lagrange function and the dual problem
- John’s theorem

- Convex optimization
- Strong duality
- The Karush-Kuhn-Tucker theorem
- The Lagrange multipliers

- Linear programming
- Optimal solutions
- Duality

- The simplex algorithm
- Standard form
- Informal description of the simplex algorithm
- Basic solutions
- The simplex algorithm
- Bland’s anti cycling rule
- Phase 1 of the simplex algorithm
- Sensitivity analysis
- The dual simplex algorithm
- Complexity