|
|
|
|
||||||||||||||
|
|
|
|
||||||||||||||
Home
Products and Services Bibliography and White Papers
|
|
ShowSimplexShowSimplex solves linear optimization problems using a variation of the classic Simplex Algorithm: a technique discovered by George Dantzig in the 1940's. Linear optimization is also known as linear programming. Here is an example of a linear programming problem that ShowSimplex solves: Find values of x1, x2, x3, x4 that Maximixes
ShowSimplex finds the solution to this problem. In this case, the solution is: Solution: x1=0, x2= 400, x3=150, x4= 400 with z=6650. ShowSimplex also displays the classical Sensitivity Analysis Reports : these show how sensitive the solutions are with respect to changes in the objective function coefficients and the RHS constants. (This means that you do not have to run ShowSimplex again to see new values for the variables or objective function after making changes to a coefficient or a RHS. The inputs to ShowSimplex is a representation of your linear programming problem: you need to specify the number of variables, the number of the three different constraints, and a representation of the objective function and constraint constants and coefficients. ShowSimplex validates the problem input and then uses its version of the simplex algorithm to find the optimal solution and produce a sensitivity report. All input and output are on web pages. (Note that Server limitations require: the maximum number of variables is 60; the maximum number of (non-default) inequality and equality constraints is 60.) View the ShowSimplex Help and Documentation. To use ShowSimplex, just post your problem to our server via HTML forms and get the answer immediately. No download or installation is needed. You do need an access license which allows you to pay-by-use as needed. If you want to see a sample run, click here .
(c) 2006 Inductive Solutions, Inc. All rights reserved.
|