Introduction and Linear Programming – Revised Simplex Algorithm-Simplex Method for Bounded Variables – One Dimensional Cutting Stock Problem – Dantzig – Wolfe Decomposition Algorithm – Primal -Dual Algorithm – Goal Programming – Formulations – Goal Programming Solutions Complexity of Simplex Algorithm – Complexity of Simplex Algorithm(Contd) Integer Programming – Integer Programming -Formulations – Solving Zero – One Problems(Contd) – Branch And Bond Algorithm For Integer Programming

Cutting Plane Algorithm – All Integer Primal Algorithm – All Integer Dual Algorithm – Network Models – Shortest Path Problem – Successive Shortest Path Problem – Minimum Cost Flow Problem – Traveling Salesman Problem(TSP) – Branch and Bound Algorithms for TSP – Heuristics for TSP – Chinese Postman Problem – Vehicle Routeing Problem – Queueing Models – Single Server Queueing Models – Multiple Server Queueing Models – Game Theory – Critical Path Method – Quadratic Programming

Other Resources

Course Curriculum

Introduction and Linear Programming Details 1:2:27
Revised Simplex Algorithm Details 57:53
Simplex Method for Bounded Variables Details 49:30
One Dimensional Cutting Stock Problem Details 58:35
One Dimensional Cutting Stock Problem(Contd) I Details 58:20
Dantzig-Wolfe Decomposition Algorithm Details 58:38
Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm I Details 57:8
Primal-Dual Algorithm Details 57:37
Goal Programming-Formulations Details 50:12
Goal Programming Solutions Complexity of Simplex Algorithm I Details 49:12
Complexity of Simplex Algorithm(Contd) Integer Programming Details 50:36
Integer Programming-Formulations Details 50:50
Solving Zero-One Problems Details 49:5
Solving Zero-One Problems(Contd) I Details 49:9
Branch And Bond Algorithm For Integer Programming Details 47:50
Cutting Plane Algorithm Details 48:39
All Integer Primal Algorithm Details 50:38
All Integer Dual Algorithm I Details 50:48
Network Models Details 58:16
Shortest Path Problem Details 58:4
Successive Shortest Path Problem Details 58:35
Maximum Flow Problem Details 58:21
Minimum Cost Flow Problem Details 58:32
Traveling Salesman Problem(TSP) Details 58:30
Branch and Bound Algorithms for TSP Details 58:6
Heuristics for TSP Details 58:8
Heuristics for TSP(Contd) Details 57:55
Chinese Postman Problem Details 58:23
Vehicle Routeing Problem Details 59:8
Queueing Models Details 58:33
Single Server Queueing Models Details 56:56
Multiple Server Queueing Models Details 56:13
Game Theory Details 58:36
Critical Path Method Details 57:56
Quadratic Programming Details 52:7

This course is part of NPTEL online courses, delivered by IIT Madras.

Course Reviews

N.A

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

No Reviews found for this course.

About

FreeVideoLectures Provides you complete information about best courses online, Video tutorials, helps you in building a career !!

help@freevideolectures.com

Learn More About us

About Us
Privacy Policy
FAQ

FREEVIDEOLECTURES.COM ALL RIGHTS RESERVED.
top
FreeVideoLectures.com All rights reserved.

Setup Menus in Admin Panel