Math 2.0

Resources / course

Constrained and unconstrained optimization G8STJEX4WZ

URIm2://res/G8STJEX4WZ
Kindcourse
CreatorsDebjani Chakraborty (instructor), A. Goswami (instructor)
Date2017-07-13
Scopein
Idscourse 03w5sq511:111105100

Expressions

e1: edition

Languageen
Date2017-07-13
Contents
  • part 1: Week 1
  • session 1: Lecture 1 : Introduction to Optimization
  • session 2: Lecture 2 : Assumptions & Mathematical Modeling of LPP
  • session 3: Lecture 3 : Geometrey of LPP
  • session 4: Lecture 4 : Graphical Solution of LPP- I
  • session 5: Lecture 5 : Graphical Solution of LPP- II
  • part 2: Week 2
  • session 6: Lecture 6: Solution of LPP: Simplex Method
  • session 7: Lecture 7: Simplex Method
  • session 8: Lecture 8: Introduction to BIG-M Method
  • session 9: Lecture 9: Algorithm of BIG-M Method
  • session 10: Lecture 10: Problems on BIG-M Method
  • part 3: Week 3
  • session 11: Lecture 11: Two Phase Method: Introduction
  • session 12: Lecture 12: Two Phase Method: Problem Solution
  • session 13: Lecture 13: Special Cases of LPP
  • session 14: Lecture 14: Degeneracy in LPP
  • session 15: Lecture 15: Sensitivity Analysis- I
  • part 4: Week 4
  • session 16: Lecture 16: Sensitivity Analysis- II
  • session 17: Lecture 17: Problems on Sensitivity Analysis
  • session 18: Lecture 18: Introduction to Duality Theory- I
  • session 19: Lecture 19: Introduction to Duality Theory- II
  • session 20: Lecture 20: Dual Simplex Method
  • part 5: Week 5
  • session 21: Lecture 21: Examples on Dual Simplex Method
  • session 22: Lecture 22: Interger Linear Programming
  • session 23: Lecture 23: Interger Linear Programming
  • session 24: Lecture 24: IPP: Branch & BBound Method
  • session 25: Lecture 25: Mixed Integer Programming Problem
  • part 6: Week 6
  • session 26: Lecture 26:Introduction to Transportation Problem I
  • session 27: Lecture 27: Transportation Problem II
  • session 28: Lecture 28: Vogel Approximation Method
  • session 29: Lecture 29: Optimal Solution Generation for Transportation Problem
  • session 30: Lecture 30: Degeneracy in TP and overview of Assingment Problem
  • part 7: Week 7
  • session 31: Lecture 31 : Introduction to Nonlinear programming
  • session 32: Lecture 32 : Graphical Solution of NLP
  • session 33: Lecture 33 : Types of NLP
  • session 34: Lecture 34 : One dimentional unconstrained optimization
  • session 35: Lecture 35 : Unconstrained Optimization
  • part 8: Week 8
  • session 36: Lecture 36 : Region Elimination Technique-1
  • session 37: Lecture 37 : Region Elimination Technique-2
  • session 38: Lecture 38 : Region Elimination Technique-3
  • session 39: Lecture 39 : Unconstrained Optimization
  • session 40: Lecture 40 : Unconstrained Optimization
  • part 9: Week 9
  • session 41: Lecture 41 : Multivariate Unconstrained Optimization-1
  • session 42: Lecture 42 : Multivariate Unconstrained Optimization-2
  • session 43: Lecture 43 : Unconstrained Optimization
  • session 44: Lecture 44: NLP with Equality Constrained-1
  • session 45: Lecture 45 : NLP with Equality Constrained-2
  • part 10: Week 10
  • session 46: Lecture 46: Constrained NLP 1
  • session 47: Lecture 47: Constrained NLP 2
  • session 48: Lecture 48: Constrained Optimization
  • session 49: Lecture 49: Constrained Optimization
  • session 50: Lecture 50: KKT
  • part 11: Week 11
  • session 51: Lecture 51: Constrained Optimization
  • session 52: Lecture 52: Constrained Optimization
  • session 53: Lecture 53: Feasible Direction
  • session 54: Lecture 54: Penalty and barrier method
  • session 55: Lecture 55: Penalty method
  • part 12: Week 12
  • session 56: Lecture 56 : Penalty and barrier method
  • session 57: Lecture 57 : Penalty and barrier method
  • session 58: Lecture 58 : Dynamic programming
  • session 59: Lecture 59 : Multi-Objective decision making
  • session 60: Lecture 60 : Multi-Attribute decision making
  • part 13: Live Session
  • session 61: Live Session 15-10-2020
  • session 62: Live Session 11-11-2020
  • session 63: Live Session 12-12-2020

Catalogue records