Mathematical
Programming
JavaScript Demos of Simplex Algorithm

Simplex

Twophase

Dijkstra

Prim

Kruskal

Ford-Fulkerson


Simplex
JavaScript demos:

FAQ
In order to solve the following Linear Programming Problem:
minimizez=-(3/2)x1-x2
subject to (5/2)x1+5x2 <=150
5x1+2x2<=120
x1>=0,x2>=0

introducing non negative slack variables x3>=0 and x4>=0, rewrite the problem in standard form:
minimizez=-(3/2)x1-x2
subject to (5/2)x1+5x2+x3=150
5x1+2x2+x4=120
x1>=0,x2>=0,x3>=0,x4>=0

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: Tuesday, 01-Sep-2015 11:30:57 JST