Skip navigation

Bookboon.com Stáhnout bezplatné e-knihy a učebnice

Choose a category

Linear and Convex Optimization

Convexity and Optimization – Part II

Linear and Convex Optimization
Doposud žádné hodnocení
ISBN: 978-87-403-1383-3
1 edice
Počet stran : 166
  • Price: 129,00 kr
  • Price: €13,99
  • Price: £13,99
  • Price: ₹250
  • Price: $13,99
  • Price: 129,00 kr
  • Price: 129,00 kr

4 snadné kroky k získání vaší e-knihy

Je nám velice líto, ale abyste mohli stahovat naše knihy nebo sledovat naše videa, budete potřebovat prohlížeč, který má povolený JavaScript.
Zadání vaší e-mailové adresy bude potvrzeno e-mailem. Budete dostávat náš měsíční zpravodaj týkající se našich knih zdarma. Jakékoli kontaktní údaje, které poskytnete, nebudou předány třetím osobám.
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

O knize

  1. Popis
  2. Obsah

Popis

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.

Obsah

  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.