Linear Programming - Mind Map

Linear Programming

The Simplex Method

When should it NOT be used?

Large problems (pivoting operations become time-consuming and expensive).

When given n decision variables. You always find a
problem instance where the question requires O(2n) operations to arrive at a solution.

Uses

To eradicate the issues in linear programming.

Examines feasible set's adjacent vertices in sequence
ensuring that the objective function is unaffected or increasing at every new vertex.

Able to evaluate whether no solution is a viable answer.

Formula

max/min Z = x1 + x2

Usually subjected to 2 or more constraints

Always subjected to the constraint > or = 0.

Terms Used

Maximum or Minimum

Maximum

The highest value of a tableau

Constraints usually limited
to < or =.

Minimum

The lowest value of a tableau

Constraints usually limited to > or =.

Real World Uses

Budgeting

Natural Diet

Manufacturing

Culinary

Advertising

Investing

Simplex Tableau

Pivot Columns

Matrix is in row-echelon form

first nonzero entry in each row is called a pivot.

Columns in which pivots appear are known as
pivot columns.

Pivot columns are identified by the most negative
number in its bottom row.

No optimal solution

Occurs when there is only one pivot column or none
at all on the tableau

Klikkaa tästä keskittääksesi karttasi.
Klikkaa tästä keskittääksesi karttasi.