Diagrama de temas

  •  
     
    • Mathematics for Business II, octubre 2013


  • Syllabus

     
    • BLOCK I. OPTIMIZATION

    • Unit 1. Local optimization

    • 1.1. Optimization without constraints
      1.2. Optimization with equality constraints
      1.2.1. Substitution method
      1.2.2. Lagrange multipliers method

    • Unit 2. Convexity and concavity

    • 2.1. Convex sets. Convex envelope
      2.2. Convex and concave functions
      2.3. Applications to Optimization
      2.4. Applications to Linear Programming

    • BLOCK II: INTRODUCTION TO LINEAR PROGRAMMING

    • Unit 3. Linear Programming. The Simplex method

    • 3.1. Situations of Linear Programming
      3.2. Problems modeling
      3.3. Graphic method. Classification of linear problems
      3.4. The simplex method


Moodle logo