Scribd
Upload
48 views3 pages

Method Name Min / Max Usual Remember Changes Ways To Solve Remember Hints

1. There are multiple methods for solving linear programming problems graphically or analytically including the graphical method, simplex method, two-phase method, big M method, and dual simplex method. 2. Each method has specific steps and considerations for solving for the maximum or minimum value of the objective function subject to the given constraints. 3. The different methods have advantages and limitations depending on the nature of the problem and whether the solution is feasible, bounded, or alternate.

Uploaded by

espritzvino
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
48 views3 pages

Method Name Min / Max Usual Remember Changes Ways To Solve Remember Hints

1. There are multiple methods for solving linear programming problems graphically or analytically including the graphical method, simplex method, two-phase method, big M method, and dual simplex method. 2. Each method has specific steps and considerations for solving for the maximum or minimum value of the objective function subject to the given constraints. 3. The different methods have advantages and limitations depending on the nature of the problem and whether the solution is feasible, bounded, or alternate.

Uploaded by

espritzvino
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

MIN / MAX

METHOD NAME REMEMBER CHANGES WAYS TO SOLVE REMEMBER HINTS


USUAL

 if Z value is In case of
1. give x1 & x2 =0 and find
same for two confusion on
the points
points – which side is the
2. find the feasible area in the
alternative feasible region
GRAPHICAL Only when 2 graph
Both  no area – for a constraint,
METHOD variables are given 3. take the extreme points of
infeasible take any point
the feasible area and solve
 no enclosed and solve in the
in Z, to find the points,
area constraint and
either max or min
-unbounded check!
 Z= variables +
1. form the basic table using Z 0s1 + 0s2 +
and constraints 0s3….
<= +slack
2. replace large Cj-Zj column  if all the Xb/Xi
SIMPLE SIMPLEX Max >= -surplus + A
3. replace small Xb/Xi value values are –ve
= +A
4. proceed till all Cj-Zj values then
are <= 0 unbounded

TWO PHASE Max Max If min comes 1. in phase I form the basic  Z^*= variables
Max (mixed) convert to max table using variables A only + 0s1 + 0s2 +
Min Z^* = -Z for Z 0s3.. –A1 –A2
2. when Z=0 (initial feasible –A3..
sol), in the same table apply  When Cj-Zj
the variables of Z values are <=0
3. find the optimal when Cj-Zj but Z is –ve,
values are <=0 infeasible
4. replace large Cj-Zj column

1. form the basic table using


all variables substituting
M for Ai’s
FOR MIN
2. replace large –ve value of
FOR MAX M in Cj-Zj
BIG M (penalty Min Ai variables in Z 3. proceed till all Cj-Zj
Min
mtd) Max should be with values are >=0
–M FOR MAX
4. replace large +ve value of
M in Cj-Zj
5. proceed till all Cj-Zj
values are <=0
1. If Min
1. Form the basis matrix
comes
2. Largest –ve value row has
convert to
to be replaced, it is Yrj
Min Max
DUAL SIMPLEX Max 3. Find (Cj-Zj)/Yrj replace
Max (Z* = -Z)
least +ve value
2. Convert all
4. Proceed till Cj-Zj values
constraints
are <=0
to <=
INFEASIBLE:
1. Cj-Zj gives the value for
max or min, but A is not
replaced in the basis
matrix
UNBOUNDED:
Infeasible 2. Replacing column is
SPECIAL CASES All Unbounded negative / Xb/Xi all are –
Alternate ve
ALTERNATE
3. When Cj-Zj values are
<=0 & any two variables
with Si, if we replace S by
X, the value of the Z
unchanged.

You might also like