ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

70 results

mathapptician
2  Extreme point optimal solution

For example, if you look at this linear programming problem, minimizing x_1 + x_2 subject to x1 + x_ >= 1, then this problem has ...

5:48
2 Extreme point optimal solution

4,002 views

10 years ago

nptelhrd
Mod-01 Lec-22 Solution of Quadratic Programming problem using Simplex Method

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

57:46
Mod-01 Lec-22 Solution of Quadratic Programming problem using Simplex Method

10,474 views

11 years ago

nptelhrd
Mod-01 Lec-16 Solution of Linear Programming using Simplex Method - Algebraic Approach

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

57:17
Mod-01 Lec-16 Solution of Linear Programming using Simplex Method - Algebraic Approach

3,623 views

11 years ago

mathapptician
1   Dual problem in general

Recall that the dual problem of this minimization problem is defined to be this linear programming problem here. There are a ...

7:50
1 Dual problem in general

1,816 views

10 years ago

Social RTCL TV
An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional... | RTCL.TV

Keywords ### #triangularneutrosophicnumbers #dualsimplexmethod #rankingfunction #linearfractionalprogramming ...

0:44
An Intelligent Dual Simplex Method to Solve Triangular Neutrosophic Linear Fractional... | RTCL.TV

136 views

2 years ago

nptelhrd
Mod-01 Lec-14 Matrix form of the Simplex Method

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

56:37
Mod-01 Lec-14 Matrix form of the Simplex Method

9,830 views

11 years ago

mathapptician
1   Linear Programming Duality

What we first do is, we first rewrite this problem to the equivalent problem: Minimizing z subject to z minus c transpose x equals 0 ...

6:33
1 Linear Programming Duality

3,112 views

10 years ago

nptelhrd
Mod-01 Lec-18 Solution of LP problems with Two - Phase Method

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

57:12
Mod-01 Lec-18 Solution of LP problems with Two - Phase Method

3,775 views

11 years ago

nptelhrd
Mod-01 Lec-17 Solution of Linear Programming using Simplex Method - Algebraic Approach (Contd.)

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

57:01
Mod-01 Lec-17 Solution of Linear Programming using Simplex Method - Algebraic Approach (Contd.)

1,482 views

11 years ago

mathapptician
1   Complementary Slackness

... definition of the dual problem of a general linear programming problem that is a minimization problem The way to complete this ...

3:55
1 Complementary Slackness

9,575 views

10 years ago

nptelhrd
Mod-01 Lec-20 Standard Primal and Dual problems

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

55:14
Mod-01 Lec-20 Standard Primal and Dual problems

4,923 views

11 years ago

nptelhrd
Mod-01 Lec-15 Matrix form of the Simplex Method (Contd.)

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

55:17
Mod-01 Lec-15 Matrix form of the Simplex Method (Contd.)

11,937 views

11 years ago

mathapptician
1   Linear Programming Basics

And we can have an unbounded problem for minimization problem as well. For example, this minimization problem is unbounded.

5:08
1 Linear Programming Basics

12,496 views

10 years ago

nptelhrd
Mod-01 Lec-29 Multi - variable optimization problem

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

1:00:02
Mod-01 Lec-29 Multi - variable optimization problem

1,811 views

11 years ago

SVSU Micro Math
Linear Programming: Minimize C=2x+y subject to x+y ≤50, x≥y, x≥20, x≥0, y≥0

Tony from SVSU Micro Math helps you solve a linear programming problem using a graphical method. Problem: Minimize C=2x+y ...

2:16
Linear Programming: Minimize C=2x+y subject to x+y ≤50, x≥y, x≥20, x≥0, y≥0

819 views

5 years ago

nptelhrd
Mod-01 Lec-19 Solution of LP problems with Two - Phase Method (Contd.)

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

59:11
Mod-01 Lec-19 Solution of LP problems with Two - Phase Method (Contd.)

1,290 views

11 years ago

mathapptician
1   Fundamental Theorem of Linear Programming

If we have a maximization problem, we can convert it to a minimization problem by taking the negative of the objective function ...

5:29
1 Fundamental Theorem of Linear Programming

12,381 views

10 years ago

nptelhrd
Mod-01 Lec-21 Relationship between Primal and Dual Variables

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

58:07
Mod-01 Lec-21 Relationship between Primal and Dual Variables

2,546 views

11 years ago

nptelhrd
Subtitle testing - Advanced Operations Research - Lec-10

Advanced operations Research - Lec-10 - Upto 7 mins.

7:02
Subtitle testing - Advanced Operations Research - Lec-10

1,612 views

11 years ago

NPTEL IIT Bombay
Lecture 17A: Slater condition and Lagrangian Dual

Week 9: Lecture 17A: Slater condition and Lagrangian Dual.

24:12
Lecture 17A: Slater condition and Lagrangian Dual

2,475 views

4 years ago

Spoken-Tutorial IIT Bombay
Optimization Using Karmarkar Function - English

Use of Scilab function karmarkar in optimization to solve linear problems. To contact the scilab team, please write to ...

8:00
Optimization Using Karmarkar Function - English

9,989 views

11 years ago

Operations Research Tezpur University
LPP Manufacturing Industry

... based optimization problems solver makes a linear programming very easy without requiring the difficult methods of simplex ...

10:23
LPP Manufacturing Industry

419 views

8 years ago

SVSU Micro Math
Linear Programming: Maximize P=4x+6y subject to 4x+4y≤8, 2x+y≤4, x≥0, y≥0

Tony from SVSU Micro Math helps you solve a linear programming problem using a graphical method. Problem: Maximize ...

3:00
Linear Programming: Maximize P=4x+6y subject to 4x+4y≤8, 2x+y≤4, x≥0, y≥0

1,414 views

5 years ago

nptelhrd
Mod-01 Lec-34 Numerical Example and Solution of Optimal Control problem

Optimal Control by Prof. G.D. Ray,Department of Electrical Engineering,IIT Kharagpur.For more details on NPTEL visit ...

1:00:24
Mod-01 Lec-34 Numerical Example and Solution of Optimal Control problem

6,993 views

11 years ago

mathapptician
1   Fourier Motzkin elimination

So for example, if i take x greater than or equal to p_j and -x greater than or equal to -q_i, from these you can infer the inequality 0 ...

4:55
1 Fourier Motzkin elimination

12,303 views

10 years ago