Optimization

0( 0 REVIEWS )
1 STUDENTS

Optimization – Introduction – Formulation of LPP – Geometry of LPP and Graphical Solution of LPP – Solution of LPP : Simplex Method – Big – M Method – Two – Phase Method – Special Cases in Simple Applications – Introduction to Duality Theory – Dual Simplex Method – Post Optimaility Analysis – Integer Programming – Introduction to Transportation Problems – Solving Various types of Transportation Problems – Assignment Problems – Project Management – Critical Path Analysis – PERT – Shortest Path Algorithm – Travelling Salesman Problem – Classical optimization techniques : Single variable optimization

Unconstarined multivariable optimization – Nonlinear programming with equality constraint – Nonlinear programming KKT conditions – Numerical optimization : Region elimination techniques – Fibonacci Method – Golden Section Methods – Interpolation Methods – Unconstarined optimization techniques : Direct search method – Unconstarined optimization techniques : Indirect search method – Nonlinear programming : constrained optimization techniques – Interior and Exterior penulty Function Method – Separable Programming Problem – Introduction to Geometric Programming – Constrained Geometric Programming Problem – Dynamic Programming Problem – Multi Objective Decision Making – Multi attribute decision making

Course Curriculum

Optimization – Introduction Details 1:59
Formulation of LPP Details 0:59
Geometry of LPP and Graphical Solution of LPP Details 57:43
Solution of LPP : Simplex Method Details 1:1:18
Big – M Method Details 58:25
Two – Phase Method Details 56:42
Special Cases in Simple Applications Details 56:52
Introduction to Duality Theory Details 59:36
Dual Simplex Method Details 58:33
Post Optimaility Analysis Details 58:38
Integer Programming – I Details 59:48
Integer Programming – II Details 57:46
Introduction to Transportation Problems Details 57:54
Solving Various types of Transportation Problems Details 57:38
Assignment Problems Details 58:31
Project Management Details 55:27
Critical Path Analysis Details 56:22
PERT Details 59:13
Shortest Path Algorithm Details 1:1:41
Travelling Salesman Problem Details 1:2:38
Classical optimization techniques : Single variable optimization Details 49:3
Unconstarined multivariable optimization Details 58:55
Nonlinear programming with equality constraint Details 1:4:1
Nonlinear programming KKT conditions Details 1:3:24
Numerical optimization : Region elimination techniques Details 54:44
Numerical optimization : Region elimination techniques (Contd.) Details 57:2
Fibonacci Method Details 56:55
Golden Section Methods Details 52:53
Interpolation Methods Details 49:1
Unconstarined optimization techniques : Direct search method Details 59:36
Unconstarined optimization techniques : Indirect search method Details 53:37
Nonlinear programming : constrained optimization techniques Details 59:59
Interior and Exterior penulty Function Method Details 53:32
Separable Programming Problem Details 59:37
Introduction to Geometric Programming Details 51:3
Constrained Geometric Programming Problem Details 49:27
Dynamic Programming Problem Details 1:3:21
Dynamic Programming Problem (Contd.) Details 1:1
Multi Objective Decision Making Details 55:44
Multi attribute decision making Details 57:39

Course Reviews

N.A

ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

FreeVideoLectures.com All rights reserved.

Setup Menus in Admin Panel