ShowSimplex

Linear Optimization

© 2002 Inductive Solutions, Inc. All rights reserved.

Sample
Problem


Step 1: Specify the Problem*
How many variables?
Note: Maximum Number of Variables: 60
How many "<="
constraints?
How many ">="
constraints?
How many "="
constraints?

Note: Maximum Number of All Constraints: 60
Copy a Table in tab-delimited text and paste it here:

*In this sample problem the text area in the form represents this linear programming problem: Find x1, x2, x3, x4 that

Maximixes z = 0 + 4x1+ 6x2+ 7x3+ 8x4
Subject to
2x1+ 3x2+ 4x3+ 7x4 <= 4600  (Cons 1)
3x1+ 4x2+ 5x3+ 6x4 <= 5000  (Cons 2)
1x4 >= 400  (Cons 3)
1x1+ 1x2+ 1x3+ 1x4 = 950  (Cons 4)

The first row corresponds to the objective function z=4x1+ 6x2+ 7x3+ 8x4. Constants are in the first column; the coeficcients of the variables are in the remaining columns.

There are 4 variables: x1, x2, x3, x4. There are 4 constraints: two <= inequality constraints, one >= inequality constraint, and one = equality constraint. (Note that the constraints must be grouped together and represented in this order. Also note that in the constraints, the coefficients are negated.)

Press the Grab Constraints button to go to the next step (to Verify the submitted Table).

(Note: If you want, this objective function/constraint table can be copied and pasted anywhere.)