Skip navigation

Bookboon.com Descarga eBooks y libros de texto gratis

Choose a category

Linear and Convex Optimization

Convexity and Optimization – Part II

Linear and Convex Optimization
Aún no ha sido puntuado
ISBN: 978-87-403-1383-3
1 edición
Páginas : 166
  • Price: 129,00 kr
  • Price: €13,99
  • Price: £13,99
  • Price: ₹250
  • Price: $13,99
  • Price: 129,00 kr
  • Price: 129,00 kr

Descarga GRATIS tus ebooks en 4 sencillos pasos

Lo sentimos, pero para poder descargar nuestros libros o ver nuestros vídeos, necesitas un navegador que permita JavaScript.
¿Podemos sugerirle eBooks gratuitos y noticias relevantes sobre Bookboon?
Después de introducir tu dirección de correo electrónico, recibirás un correo de confirmación. Confirma este correo para recibir el boletín de noticias mensual con respecto a libros de texto gratuitos. Los datos de contacto que nos proporciones no serán proporcionados a terceros.
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

Acerca del libro

  1. Descripción
  2. Contenido

Descripción

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.

Contenido

  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
This website uses cookies to improve user experience. By using our website you consent to all cookies in accordance with EU regulation.