Skip navigation

Bookboon.com Download free eBooks and textbooks

Choose a category

Linear and Convex Optimization

Convexity and Optimization – Part II

Linear and Convex Optimization
Not enough reviews yet
ISBN: 978-87-403-1383-3
1 edition
Pages : 166
  • Price: 129.00 kr
  • Price: €13.99
  • Price: £13.99
  • Price: ₹250
  • Price: $13.99
  • Price: 129.00 kr
  • Price: 129.00 kr

Download for FREE in 4 easy steps...

We are terribly sorry, but in order to download our books or watch our videos, you will need a browser that allows JavaScript.
After entering your email address, a confirmation email will be sent to your inbox. Please approve this email to receive our weekly eBook update. We will not share your personal information with any third party.
eLib
Unlock your organization's learning potential
See Demo

Corporate eLibrary

Discover our employee learning solutions

This is a Premium eBook

Bookboon Premium - Gain access to over 800 eBooks - without ads

You can get free access for a month to this - and 800 other books with the Premium Subscription. You can also buy the book below

  • Start a 30-day free trial. After trial: 39.99 kr p/m
  • Start a 30-day free trial. After trial: €5.99 p/m
  • Start a 30-day free trial. After trial: £4.99 p/m
  • Start a 30-day free trial. After trial: ₹299 p/m
  • Start a 30-day free trial. After trial: $3.99 p/m
  • Start a 30-day free trial. After trial: 39.99 kr p/m
  • Start a 30-day free trial. After trial: 39.99 kr p/m
eLib
Unlock your organization's learning potential
Click here!

Corporate eLibrary

Discover our employee learning solutions

About the book

  1. Description
  2. Content
  3. About the Author

Description

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.

Content

  1. Optimization
    1. Optimization problems
    2. Classification of optimization problems
    3. Equivalent problem formulations
    4. Some model examples
  2. The Lagrange function
    1. The Lagrange function and the dual problem
    2. John’s theorem
  3. Convex optimization
    1. Strong duality
    2. The Karush-Kuhn-Tucker theorem
    3. The Lagrange multipliers
  4. Linear programming
    1. Optimal solutions
    2. Duality
  5. The simplex algorithm
    1. Standard form
    2. Informal description of the simplex algorithm
    3. Basic solutions
    4. The simplex algorithm
    5. Bland’s anti cycling rule
    6. Phase 1 of the simplex algorithm
    7. Sensitivity analysis
    8. The dual simplex algorithm
    9. Complexity

About the Author

Lars-Åke Lindahl obtained his mathematical education at Uppsala University and Institut Mittag-Leffler and got a Ph.D. in Mathematics in 1971 with a thesis on Harmonic Analysis. Shortly thereafter he was employed as senior lecturer in Mathematics at Uppsala University, where he remained until his retirement in 2010 and for more than 20 years served as chairman of the Math. Department.

He has given lectures in a variety of mathematical subjects such as Calculus, Linear Algebra, Fourier Analysis, Complex Analysis, Convex Optimization, Game Theory and Probability Theory, and he has also written several textbooks and compendia. After his retirement, he has been a consultant to Al Baha University, Saudi Arabia, with a mission to assist in the development of their master's program in Mathematics.

This website uses cookies to improve user experience. By using our website you consent to all cookies in accordance with EU regulation.