Solution and graph of linear programming problem by simplex online method on Intellect

Used 872 times

Solution of linear programming problem by simplex online method

Specify the objective function — max/min
Specify the number of variables and constraints,
All variables must be non-negative.

Objective function min max

Number of variables:

Number of constraints:

All variables must be non-negative.

Constraints

Objective function

max Z =

X_i >= 0 , где i =1,...,2

Reset

Was this answer useful?

Choose a quick rating so we can improve the next answer for you.

How satisfied are you?

Your answer option for this service or noticed an error:

Linear programming is a branch of mathematical programming,
who studies optimization problems with linear objective functions
and linear constraints (equalities or inequalities).
In addition to the analytical simplex method, this online service also provides a graphical solution.
For problems with two variables a 2D plot is built automatically: all constraint lines with labels,
the shaded feasible region, the coordinates of the polygon vertices, the objective gradient vector,
the level line and the optimum point. The chart is scaled proportionally so that every line fits.
If there are more than two variables, the feasible region cannot be drawn on a 2D plane, and the simplex method is used instead.

Algebra

Solution and graph of linear programming problem by simplex online method on Intellect

Comments

To leave a comment