Math 2.0

Resources / course

Optimization YC91S2RTE8

URIm2://res/YC91S2RTE8
Kindcourse
CreatorsDebjani Chakraborty (instructor), A. Goswami (instructor)
Date2014-06-10
Scopein
Idscourse 03w5sq511:111105039

Expressions

e1: edition

Languageen
Date2014-06-10
Contents
  • part 1: Optimization - Introduction
  • session 1: Optimization - Introduction
  • part 2: Formulation of LPP
  • session 2: Formulation of LPP
  • part 3: Geometry of LPP and Graphical Solution of LPP
  • session 3: Geometry of LPP and Graphical Solution of LPP
  • part 4: Solution of LPP : Simplex Method
  • session 4: Solution of LPP : Simplex Method
  • part 5: Big - M Method
  • session 5: Big - M Method
  • part 6: Two - Phase Method
  • session 6: Two - Phase Method
  • part 7: Special Cases in Simple Applications
  • session 7: Special Cases in Simple Applications
  • part 8: Introduction to Duality Theory
  • session 8: Introduction to Duality Theory
  • part 9: Dual Simplex Method
  • session 9: Dual Simplex Method
  • part 10: Post Optimaility Analysis
  • session 10: Post Optimaility Analysis
  • part 11: Integer Programming - I
  • session 11: Integer Programming - I
  • part 12: Integer Programming - II
  • session 12: Integer Programming - II
  • part 13: Introduction to Transportation Problems
  • session 13: Introduction to Transportation Problems
  • part 14: Solving Various types of Transportation Problems
  • session 14: Solving Various types of Transportation Problems
  • part 15: Assignment Problems
  • session 15: Assignment Problems
  • part 16: Project Management
  • session 16: Project Management
  • part 17: Critical Path Analysis
  • session 17: Critical Path Analysis
  • part 18: PERT
  • session 18: PERT
  • part 19: Shortest Path Algorithm
  • session 19: Shortest Path Algorithm
  • part 20: Travelling Salesman Problem
  • session 20: Travelling Salesman Problem
  • part 21: Classical optimization techniques : Single variable optimization
  • session 21: Classical optimization techniques : Single variable optimization
  • part 22: Unconstarined multivariable optimization
  • session 22: Unconstarined multivariable optimization
  • part 23: Nonlinear programming with equality constraint
  • session 23: Nonlinear programming with equality constraint
  • part 24: Nonlinear programming KKT conditions
  • session 24: Nonlinear programming KKT conditions
  • part 25: Numerical optimization : Region elimination techniques
  • session 25: Numerical optimization : Region elimination techniques
  • session 26: Numerical optimization : Region elimination techniques (Contd.)
  • part 26: Fibonacci Method
  • session 27: Fibonacci Method
  • part 27: Golden Section Methods
  • session 28: Golden Section Methods
  • part 28: Interpolation Methods
  • session 29: Interpolation Methods
  • part 29: Unconstarined optimization techniques : Direct search method
  • session 30: Unconstarined optimization techniques : Direct search method
  • part 30: Unconstarined optimization techniques : Indirect search method
  • session 31: Unconstarined optimization techniques : Indirect search method
  • part 31: Nonlinear programming : constrained optimization techniques
  • session 32: Nonlinear programming : constrained optimization techniques
  • part 32: Interior and Exterior penulty Function Method
  • session 33: Interior and Exterior penulty Function Method
  • part 33: Separable Programming Problem
  • session 34: Separable Programming Problem
  • part 34: Introduction to Geometric Programming
  • session 35: Introduction to Geometric Programming
  • part 35: Constrained Geometric Programming Problem
  • session 36: Constrained Geometric Programming Problem
  • part 36: Dynamic Programming Problem
  • session 37: Dynamic Programming Problem
  • session 38: Dynamic Programming Problem (Contd.)
  • part 37: Multi Objective Decision Making
  • session 39: Multi Objective Decision Making
  • part 38: Multi attribute decision making
  • session 40: Multi attribute decision making

Catalogue records