Toggle navigation
Institute
IISc Bangalore
IIT Bombay
IIT Delhi
IIT Guwahati
IIT Kanpur
IIT Kharagpur
IIT Madras
IIT Roorkee
Discipline
Aerospace Engineering
Atmospheric Science
Basic courses
Biotechnology
Chemical Engineering
Chemistry and Biochemistry
Civil Engineering
Computer Science and Engineering
Electrical Engineering
Electronics & Communication Engineering
Engineering Design
General
Humanities and Social Sciences
Management
Mathematics
Mechanical Engineering
Home
Mathematics
Linear programming and Extensi..
Lecture# 39
'Lecture_39_ Simplex Algorithm is not polynomial time- An example.' Video Lecture
Lecture_39_ Simplex Algorithm is not polynomial time- An example.
Course
:
Linear programming and Extensions
Discipline
:
Mathematics
Faculty
: Prof. Prabha Sharma
Institute
:
IIT Kanpur
Lecture_39_ Simplex Algorithm is not polynomial time- An example.
- Browse through
Linear programming and Extensions (Mathematics)
Video Lectures by
Prof. Prabha Sharma
from
IIT Kanpur
through NPTEL.
Course
:
Linear programming and Extensions
Discipline
:
Mathematics
Faculty
: Prof. Prabha Sharma
Institute
:
IIT Kanpur
NEXT LECTURE >>
Lecture_40_Interior Point Methods .
Download this video in MP4, FLV & 3GP formats
Format
Size
Download
MP4
441 MB
MP4 Video Download Link 1
MP4
441 MB
MP4 Video Download Link 2
FLV
132 MB
FLV Video Download Link 1
FLV
132 MB
FLV Video Download Link 2
3gp
63 MB
3gp Video Download Link 1
3gp
63 MB
3gp Video Download Link 2
Search Courses by Discipline & Institute
Search Courses
Discipline
All Disciplines
Aerospace Engineering
Atmospheric Science
Basic courses
Biotechnology
Chemical Engineering
Chemistry and Biochemistry
Civil Engineering
Computer Science and Engineering
Electrical Engineering
Electronics and Communication Engineering
Engineering Design
General
Humanities and Social Sciences
Management
Mathematics
Mechanical Engineering
Institute
All Institutes
IISc Bangalore
IIT Bombay
IIT Delhi
IIT Guwahati
IIT Kanpur
IIT Kharagpur
IIT Madras
IIT Roorkee
SASTRA University
Search
Course Video Lectures
Lecture_01_Introduction to Linear Programming..
Lecture_02_ Vector space, Linear independence..
Lec_03_Moving from one basic feasible solutio..
Lecture_04_Basic feasible solutions, existenc..
Lecture_5_Convex sets, dimension of a polyhed..
Lecture_6_Direction of a polyhedron, correspo..
Lecture_7_Representation theorem, LPP solutio..
Lecture_08_Development of the Simplex Algorit..
Lecture_9_ Simplex Tableau & algorithm ,Cycli..
Lecture_10_ Big-M method,Graphical solutions,..
Lecture_11_Assignment 2, progress of Simplex ..
Lecture_12_LPP Bounded variable, Revised Simp..
Lecture_13_Weak duality theorem, economic int..
Lecture_14_Examples of writing the dual, comp..
Lecture_15_Complementary slackness conditions..
Lecture_16_Primal-dual algorithm.
Lecture_17_Problem in lecture 16, starting du..
Lecture_18_Shortest Path Problem, Primal-dual..
Lecture_19_Shortest Path Problem-complexity, ..
Lecture_20_ Assignment 4, postoptimality ana..
Lecture_21_Parametric LPP-Right hand side vec..
Lecture_22_Parametric cost vector LPP.
Lecture_23_Parametric cost vector LPP, Intro..
Lecture_24_Mini-cost flow problem-Transportat..
Lecture_25_Transportation problem degeneracy..
Lecture_26_ Sensitivity analysis.
Lecture_27_ Sensitivity analysis.
Lecture_28_Bounded variable transportation pr..
Lecture_29_Min-cost flow problem
Lecture_30_Starting feasible solution, Lexico..
Lecture_31_Assignment 6, Shortest path proble..
Lecture_32_ Min-cost-flow Sensitivity analysi..
Lecture_33_Min-cost flow changes in arc capac..
Lecture_34_Problem 3 (assignment 7), Min-cut ..
Lecture_35_Max-flow - Critical capacity of an..
Lecture_36_Improved Max-flow algorithm.
Lecture_37_Critical Path Method (CPM).
Lecture_38_Programme Evaluation and Review Te..
Lecture_39_ Simplex Algorithm is not polynomi..
Lecture_40_Interior Point Methods .
2015. EngineeringVideoLectures.com