0% found this document useful (0 votes)
11 views12 pages

Linear Programming Problem Examples

Uploaded by

Desai Nehal
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views12 pages

Linear Programming Problem Examples

Uploaded by

Desai Nehal
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

-Dr.

Parth Modi
SKSBM, Patan
Extra Variable in Presence of Extra
Types of Extra Variable Objective Function variable in Initial
Constraint Needed Solution Mix
Max Z Min Z (Basis)
Less than
A Slack variable (S)
or Equal to 0 0 Yes
is added
(≤)
A Surplus variable
Greater 0 0 No
(S) is subtracted
than or
Equal to (≥) Artificial Variable
-M +M Yes
(A) is Added
Only Artificial
Variable (A) is
Equal to (=) -M +M Yes
Added
Maximize
Z = 40X1 + 35X2
Subject to
2X1 + 3X2 ≤ 60
4X1 + 3X2 ≤ 96

X1, X2 ≥0
Maximize
Z = 5X1 + 10X2 + 8X3
Subject to
3X1 + 5X2 + 2X3 ≤ 60
4X1 + 4X2 + 4X3 ≤ 72
2X1 + 4X2 + 5X3 ≤ 100
X1, X2, X3 ≥0
Minimize
Z = 40X1 + 24X2
Subject to
20X1 + 50X2 ≥ 4,800
80X1 + 50X2 ≥ 7,200

X1, X2 ≥0
Minimize
Z = 150X1 + 150X2 + 100X3
Subject to
2X1 + 3X2 + X3 ≥ 4
3X1 + 2X2 + X3 ≥ 3

X1, X2, X3 ≥0
An Air Force is experimenting with three types of
bombs P, Q and R in which three kind of
explosives, viz., A, B, and C will be used. Taking
the various factors in to account, it has been
decided to use the maximum 600 kg of explosive
A, at least 480 kg of explosive B and exactly 540
kg of explosive C. Bomb P requires 3, 2, 2 kg,
bomb Q requires 1, 4, 3 kg and bomb R requires
4, 2, 3 kg of explosives A, B and C respectively.
Bomb P is estimated to give the equivalent of a 2
ton explosion, bomb Q a 3 ton explosion and
bomb R a 4 ton explosion respectively. Under
what production schedule can the Air Force make
the biggest bang?
Maximize
Z = 2X1 + 4X2
Subject to
2X1 + X2 ≤ 18
3X1 + 2X2 ≥ 30
X1 + 2X2 = 26

X1, X2 ≥0
Minimize
Z = 5X1 + 2X2
Subject to
2X1 + 4X2 ≤ 12
2X1 + 2X2 = 10
5X1 + 2X2 ≥ 10

X1, X2 ≥0
Maximize
Z = 4X1 + 3X2
Subject to
2X1 + X2 ≤ 1000
X1 + X2 ≤ 800
X1 ≤ 400
X2 ≤ 700
X1, X2 ≥0
When in the final solution, an artificial variable is
in the basis at a positive value then there is no
feasible solution to the problem.
Maximize
Z = 20X1 + 30X2
Subject to
2X1 + X2 ≤ 40
4X1 - X2 ≤ 20
X1 ≥ 30

X1, X2 ≥0
There are no non-negative outgoing variable or
they are equal to ∞ (infinite), then problem has
unbounded solution.
Maximize
Z = 10X1 + 20X2
Subject to
2X1 + 4X2 ≥ 16
X1 + 5X2 ≥ 15

X1, X2 ≥0

You might also like