Simplex Method Algorithm.avi
Loading...
Uploader Comments (mathm09)
Top Comments
-
this video would be much better with audio...
1 year ago 3
-
value 240 at 4:47 ...
r5 ' = r5 - (-60) r2 ' = r5 +60 r2 ' = 0 + 60*4 = 240
value 280 at 8:38 ...
r5 '' = r5' - (-5) r1 '' = r5 ' +5 r1 '' = 240 + 5*8 = 240 + 40 = 280
An alternative way to get these 2 values : sumproduct of yellow columns at right , that is (4:47) 4*60=240 (only x1 is in the basic variables) and (8:38) 2*60 + 8*20 = 120 + 160 = 280 (x1 and x3 are in the basic variables). Objective function 60x1+30x2+20x3 gets these values for solutions {4,0,0} and {2,0,8} respectively.
All Comments (21)
-
I want to watch" shortest path problem" with "floyd method". I didn't find. How can I find. do you have any videos about this
-
Lost it when we got to the 2nd Simplex tableau. T_T
-
managerial accounting
-
This video would be much better if you had audio, and didn't move so fast. Really hard to follow with the speed...
-
However, a min problem, with all constraints <=, can easily have, not bounded solution (when constraints have at least one negative term) or trivial solution {0,0,0} (all constraints have only positive terms, our case study: for {1,0,0} or {0,2,0} zz is negative, so max zz is 0 for {0,0,0}).
-
The sign (+,-) in objective function's terms (not only in constraints) makes also a difference. min z=60x1 - 30x2 + 20x3 ( -30 !! ) with same constraints would have another solution (not {0,0,0} from the initial Simplex table).
-
Note: First row in 1st table is 60 30 20 0 0 0 0 , last row in 1st table is -60 -30 -20 0 0 0 0
and termination rule is " no <0 values in last row" (optimal solution).
In many textbooks: First row in 1st table is 60 30 20 0 0 0 0 last row in 1st table is also 60 30 20 0 0 0 0
and termination rule is inversed " no >0 values in last row" (optimal solution).
Both ways, algorithm's conclusions are the same.
- 4:35
simplex3by teachertubemath5,425 views
- 5:09
Speedlearning 5 - Simplex Methodeby PFHGoettingen6,977 views
- 0:38
Very Angry Asian Teacherby halimbb353,467 views
- 2:57
Best Friends Forever episode 2by SoSimlish610,018 views
- 3:28
Profesora Ricaby chancestro3,390,041 views
- 2:27
Tutorial Excel Solver 2007by robertoneto12340,123 views
- 6:28
Método Simplexby rgarrido1006,325 views
- 8:50
Método Simplexby rgarrido10030,751 views
- 8:52
Método Simplexby rgarrido1005,516 views
- 4:39
Linear Programming Exampleby EngineeringVideosNet12,053 views
- 8:21
investigaciondeoperaciones metodo simplex 1.mp4by sergiortega2223,457 views
- 9:49
simplexe 3.1by infomaths5,686 views
- 5:34
Simplexby teachertubemath8,018 views
- 12:17
Spreadsheet Optimization with Excelby SpaceOverTime5,654 views
- 3:01
Metodo Simplexby necioks11,250 views
- 0:59
Dimitri und die Frauenby Dizbrothek17,409 views
- 4:16
Speedlearning 4 - Lineare Optimierungby PFHGoettingen3,656 views
- 9:51
Meine wunderschöne BWL-Vorlesungby dievalabelle14,155 views
- 22:56
Método Simplexby marcelrzmuo23,354 views
Is it a must that a pivot number to has a value of 1 after we have already found it? I mean why do you divide row2 by 2?
glorfindel133 8 months ago
@glorfindel133 Yes.. at 2:14 , x1 becomes basic variable and s2 leaves basic variables (these actions are based on which was pivot column and row respectively)... since x1 turns to a basic variable, we should have value 1 where x1 (basic variables, vertical order) crosses itself (horizontal order) ... since the pivot number was 2 (initial table), we divide by 2 to get that value 1 (2nd table), but we have also to divide by 2 (apply the same operation on) the rest elements of the pivot row.
mathm09 8 months ago