Suivant

⁣35. Delta-Functions, Eigen-Functions of X, Discrete Variable Representation
00:48:42
⁣35. Delta-Functions, Eigen-Functions of X, Discrete Variable Representation
MITCourses
12 Vues · 19 Nov 2019
Maths & Sciences
⁣Lecture 32 - Gauss Divergence Theorem
00:36:42
⁣Lecture 32 - Gauss Divergence Theorem
IIT_Kanpur
7 Vues · 13 Nov 2019
Maths & Sciences
⁣Lecture 31 - Stokes Theorem
00:53:57
⁣Lecture 31 - Stokes Theorem
IIT_Kanpur
8 Vues · 13 Nov 2019
Maths & Sciences
⁣Lecture 30 - Green's Theorem
00:52:35
⁣Lecture 30 - Green's Theorem
IIT_Kanpur
8 Vues · 13 Nov 2019
Maths & Sciences
⁣Lecture 25 - Mean Value Theorem
00:52:03
⁣Lecture 25 - Mean Value Theorem
IIT_Kanpur
6 Vues · 13 Nov 2019
Maths & Sciences
⁣Lecture 11 -Taylor's Theorem
00:53:10
⁣Lecture 11 -Taylor's Theorem
IIT_Kanpur
8 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-35 Max-flow - Critical capacity of an arc, starting solution for min-cost flow problem.
01:04:06
⁣Mod-01 Lec-35 Max-flow - Critical capacity of an arc, starting solution for min-cost flow problem.
IIT_Kanpur
17 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-34 Problem 3 (assignment 7), Min-cut Max-flow theorem, Labelling algorithm.
01:01:26
⁣Mod-01 Lec-34 Problem 3 (assignment 7), Min-cut Max-flow theorem, Labelling algorithm.
IIT_Kanpur
9 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-33 Min-cost flow changes in arc capacities , Max-flow problem, assignment 7
00:55:43
⁣Mod-01 Lec-33 Min-cost flow changes in arc capacities , Max-flow problem, assignment 7
IIT_Kanpur
13 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-31 Assignment 6, Shortest path problem, Shortest Path between any two nodes
00:55:04
⁣Mod-01 Lec-31 Assignment 6, Shortest path problem, Shortest Path between any two nodes
IIT_Kanpur
10 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-30 Starting feasible solution, Lexicographic method for preventing cycling
00:59:23
⁣Mod-01 Lec-30 Starting feasible solution, Lexicographic method for preventing cycling
IIT_Kanpur
10 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-20 Assignment 4, postoptimality analysis, changes in b, adding a new constraint
00:56:11
⁣Mod-01 Lec-20 Assignment 4, postoptimality analysis, changes in b, adding a new constraint
IIT_Kanpur
24 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-17 Problem in lecture 16, starting dual feasible solution, Shortest Path Problem.
00:56:30
⁣Mod-01 Lec-17 Problem in lecture 16, starting dual feasible solution, Shortest Path Problem.
IIT_Kanpur
9 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-15 Complementary slackness conditions, Dual Simplex algorithm, Assignment 3.
00:50:38
⁣Mod-01 Lec-15 Complementary slackness conditions, Dual Simplex algorithm, Assignment 3.
IIT_Kanpur
5 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-14 Examples of writing the dual, complementary slackness theorem.
00:53:56
⁣Mod-01 Lec-14 Examples of writing the dual, complementary slackness theorem.
IIT_Kanpur
8 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-13 Weak duality theorem, economic interpretation of dual variables
00:57:17
⁣Mod-01 Lec-13 Weak duality theorem, economic interpretation of dual variables
IIT_Kanpur
11 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-12 LPP Bounded variable, Revised Simplex algorithm, Duality theory, weak duality theorem.
00:53:43
⁣Mod-01 Lec-12 LPP Bounded variable, Revised Simplex algorithm, Duality theory, weak duality theorem.
IIT_Kanpur
4 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-11 Assignment 2, progress of Simplex algorithm on a polytope, bounded variable LPP
01:02:26
⁣Mod-01 Lec-11 Assignment 2, progress of Simplex algorithm on a polytope, bounded variable LPP
IIT_Kanpur
11 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-03 Moving from one basic feasible solution to another, optimality criteria.
01:02:38
⁣Mod-01 Lec-03 Moving from one basic feasible solution to another, optimality criteria.
IIT_Kanpur
24 Vues · 12 Nov 2019
Maths & Sciences

Mod-01 Lec-07 Representation theorem, LPP solution is a bfs, Assignment 1

14 Vues· 12 Nov 2019
IIT_Kanpur
IIT_Kanpur
5 subscribers
0
Dans Maths & Sciences / Mathématiques

Linear programming and Extensions by Prof. Prabha Sharma, Department of Mathematics and Statistics, IIT Kanpur For more details on NPTEL visit http://nptel.iitm.ac.in

Montre plus
100% online learning from the world's best universities, organisations and Instructors
 0 commentaires sort   Trier par


Suivant


⁣35. Delta-Functions, Eigen-Functions of X, Discrete Variable Representation
00:48:42
⁣35. Delta-Functions, Eigen-Functions of X, Discrete Variable Representation
MITCourses
12 Vues · 19 Nov 2019
Maths & Sciences
⁣Lecture 32 - Gauss Divergence Theorem
00:36:42
⁣Lecture 32 - Gauss Divergence Theorem
IIT_Kanpur
7 Vues · 13 Nov 2019
Maths & Sciences
⁣Lecture 31 - Stokes Theorem
00:53:57
⁣Lecture 31 - Stokes Theorem
IIT_Kanpur
8 Vues · 13 Nov 2019
Maths & Sciences
⁣Lecture 30 - Green's Theorem
00:52:35
⁣Lecture 30 - Green's Theorem
IIT_Kanpur
8 Vues · 13 Nov 2019
Maths & Sciences
⁣Lecture 25 - Mean Value Theorem
00:52:03
⁣Lecture 25 - Mean Value Theorem
IIT_Kanpur
6 Vues · 13 Nov 2019
Maths & Sciences
⁣Lecture 11 -Taylor's Theorem
00:53:10
⁣Lecture 11 -Taylor's Theorem
IIT_Kanpur
8 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-35 Max-flow - Critical capacity of an arc, starting solution for min-cost flow problem.
01:04:06
⁣Mod-01 Lec-35 Max-flow - Critical capacity of an arc, starting solution for min-cost flow problem.
IIT_Kanpur
17 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-34 Problem 3 (assignment 7), Min-cut Max-flow theorem, Labelling algorithm.
01:01:26
⁣Mod-01 Lec-34 Problem 3 (assignment 7), Min-cut Max-flow theorem, Labelling algorithm.
IIT_Kanpur
9 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-33 Min-cost flow changes in arc capacities , Max-flow problem, assignment 7
00:55:43
⁣Mod-01 Lec-33 Min-cost flow changes in arc capacities , Max-flow problem, assignment 7
IIT_Kanpur
13 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-31 Assignment 6, Shortest path problem, Shortest Path between any two nodes
00:55:04
⁣Mod-01 Lec-31 Assignment 6, Shortest path problem, Shortest Path between any two nodes
IIT_Kanpur
10 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-30 Starting feasible solution, Lexicographic method for preventing cycling
00:59:23
⁣Mod-01 Lec-30 Starting feasible solution, Lexicographic method for preventing cycling
IIT_Kanpur
10 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-20 Assignment 4, postoptimality analysis, changes in b, adding a new constraint
00:56:11
⁣Mod-01 Lec-20 Assignment 4, postoptimality analysis, changes in b, adding a new constraint
IIT_Kanpur
24 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-17 Problem in lecture 16, starting dual feasible solution, Shortest Path Problem.
00:56:30
⁣Mod-01 Lec-17 Problem in lecture 16, starting dual feasible solution, Shortest Path Problem.
IIT_Kanpur
9 Vues · 13 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-15 Complementary slackness conditions, Dual Simplex algorithm, Assignment 3.
00:50:38
⁣Mod-01 Lec-15 Complementary slackness conditions, Dual Simplex algorithm, Assignment 3.
IIT_Kanpur
5 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-14 Examples of writing the dual, complementary slackness theorem.
00:53:56
⁣Mod-01 Lec-14 Examples of writing the dual, complementary slackness theorem.
IIT_Kanpur
8 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-13 Weak duality theorem, economic interpretation of dual variables
00:57:17
⁣Mod-01 Lec-13 Weak duality theorem, economic interpretation of dual variables
IIT_Kanpur
11 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-12 LPP Bounded variable, Revised Simplex algorithm, Duality theory, weak duality theorem.
00:53:43
⁣Mod-01 Lec-12 LPP Bounded variable, Revised Simplex algorithm, Duality theory, weak duality theorem.
IIT_Kanpur
4 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-11 Assignment 2, progress of Simplex algorithm on a polytope, bounded variable LPP
01:02:26
⁣Mod-01 Lec-11 Assignment 2, progress of Simplex algorithm on a polytope, bounded variable LPP
IIT_Kanpur
11 Vues · 12 Nov 2019
Maths & Sciences
⁣Mod-01 Lec-03 Moving from one basic feasible solution to another, optimality criteria.
01:02:38
⁣Mod-01 Lec-03 Moving from one basic feasible solution to another, optimality criteria.
IIT_Kanpur
24 Vues · 12 Nov 2019
Maths & Sciences