|
Mathematical Programming |
Java Applet Demos of Simplex Algorithm | ||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
Simplex Java applet demos: FAQ |
Download Java Runtime Envireonment In order to solve the following Linear Programming Problem:
introducing non negative slack variables x3>=0 and x4>=0, rewrite the problem in standard form:
Select the slack variables x3 and x4 as the basic variables, x1=x2=0, x3=150, and x4=120 are the basic feasible solutions (bfs). So, organize the simplex tableau of cycle 0 with the basic variables x3 and x4. Pivoting the above tableau 2 times (click on the tableau 8 times), all the relative costs become non negative, which means we obtain an optimal solution z = -45 when x1=15 and x2=45/2. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Kenji Ikeda's Home Page |
Last Modified:
Monday, 26-Jun-2006 09:48:55 JST
|