Scribd
Upload
17 views20 pages

Lecture 4 Chapter 2

Uploaded by

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

Lecture 4 Chapter 2

Uploaded by

Muzafar Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

Complete Reddy Mikks model:

Maximize z = 5 x1 + 4 x2 (total daily profit)


subject to
6x + 4x < 24 (raw material M1)
1 2

x + 2x < 6 (raw material M2)


1 2

x -x < 12 1

x < 2 2

x > 01

x > 0 2

- Objective
and the constraints are all linear in this
example.
1
.2 GRAPHICAL LP SOLUTION

The graphical procedure includes two


steps:
1) Determination of the feasible
solution space.
2) Determination of the optimum
solution from among all the feasible
points in the solution space.

2
2.2.1 Solution of a Maximization model
Example 2.2-1 (Reddy Mikks model)
Step 1:
1) Determination of the feasible solution space:
- Find the coordinates for all the 6 equations of
the restrictions (only take the equality sign)
6x1 + 4x2 < 24 1

x1 + 2x2 < 6 2

x2 - x1 < 1 3

x2 < 2 4

x1 > 0 5

x2 > 0 6 3
- Change all equations to equality signs
6x1 + 4x2 = 24 1

x1 + 2x2 = 6 2

x2 - x1 1 3
=

x2 = 2 4

x1 = 0 5

x2 = 0 6

4
5
Step 2:
2) Determination of the optimum solution from among
all the feasible points in the solution space:
- After finding out all the feasible half-spaces of all
the 6 equations, feasible space is obtained by the
line segments joining all the corner points A, B, C,
D ,E and F
- Any point within or on the boundary of the
solution space ABCDEF is feasible as it satisfies all
the constraints
- Feasible space ABCDEF consists of infinite number
of feasible points

6
Since optimum LP solution is always associated
with a corner point of the solution space, so
optimum solution can be found by enumerating all
the corner points as below:-
Corner point (x1, x2) z
A (0, 0) 0
B (4, 0) 20
(optimum
C (3,1.5) 21 solution)
D (2, 2) 18
E (1, 2) 13
F (0, 1) 4
- As number of constraints and variables
increases , the number of corner points also
increases
7
Example 2.2 (Diet Problem)

Ozark Farm Uses at Least 800 Ib of Special feed daily. The


special feed is mixture of corn and soybean meal with the
following compositions:

Ib per Ib of feedstuff
Feedstuff Protein Fiber Cost($/Ib)

Corn 0.09 0.02 0.30


Soybean meal 0.60 0.60 0.90

The dietary requirements of the special feed are at least


30% protein at most 5% fiber . Ozark Farms wishes to
determine the daily minimum-cost feed mix.
Solution
As for the protein dietary requirement constraint, the amount of
protein included in X1 Ib of corn and X2 Ib of soybean meal is (0.09X1
+0.6 X2) Ib. This quantity should equal at least 30% of the total feed
mix (X1 + X2) Ib that is

0.09X1 +0.6 X2 >= 0.3(X1 +X2)


0.09X1 +0.6 X2 >= 0.3X1 + 0.3X2)
0.09X1 - 0.3X1 +0.6 X2 - 0.3X2 >=0

- 0.21X1 +0.3 X2 >=0

0.21X1 - 0.3 X2 <=0


In a Similar manner, the fiber requirement of at most 5%
is constructed

0.02X1 +0.06 X2 >= 0.05(X1 + X2)


0.02X1 +0.06 X2 >= 0.05X1 + 0.05X2)
0.02X1 - 0.05X1 +0.06 X2 - 0.05X2 >=0
- 0.03X1 + 0.01 X2 >=0

0.03X1 - 0.01 X2 <=0 Fiber

Object:

Minimize Z = 0.3x1 +0.9x2


The Complete model Thus becomes

Object:
Minimize Z = 0.3x1 +0.9x2
Subject:

X1 + X2 = 800 FeedStuff

0.03X1 - 0.01 X2 = 0 Fiber

0.21X1 -0.3 X2 = 0 Protein


14
Example 2.1-2
(Problem Mix Model)

- Two machines X and Y


- X is designed for 5-ounce bottles
- Y is designed for 10-ounce bottles
- X can also produce 10-ounce bottles with some
loss of efficiency
- Y can also produce 5-ounce bottles with some
loss of efficiency

15
Machine 5-ounce bottles 10-ounce bottles
X 80/min 30/min
Y 40/min 50/min
- X and Y machines can run 8 hours per day for 5
days a week
- Profit on 5-ounce bottle is 20 paise
- Profit on 10-ounce bottle is 30 paise
- Weekly production of the drink cannot exceed
500,000 ounces
- Market can utilize 30,000 (5-ounce) bottles and
8000 (10-ounce) bottles per week
- To maximize the profit
16
Solution:

Let x1 = number of 5-ounce bottles to be produced per week


x2 = number of 10-ounce bottles to be produced per week
Objective:
Maximize profit z = Rs (0.20x1 + 0.30x2)
Constraints:
- Time constraint on machine X,
(x1/80) + (x2/30) < 8 X 60 X 5 = 2400 minutes
- Time constraint on machine Y,
(x1/40) + (x2/50) < 8 X 60 X 5 = 2400 minutes
- Weekly production of the drink cannot exceed 500,000 ounces,
5x1 + 10x2 < 500,000 ounces
- Market demand per week,
x1 > 30,000 (5-ounce bottles)
x2 > 8,000 (10-ounce bottles)

17
Example 2.1-3
(Production Allocation Model)

- Two types of products A and B


- Profit of Rs.4 on type A
- Profit of Rs.5 on type B
- Both A and B are produced by X and Y machines
Machine Machine
Products X Y
A 2 minutes 3 minutes
B 2 minutes 2 minutes

- Machine X is available for maximum 5 hours and 30 minutes during any


working day

- Machine Y is available for maximum 8 hours during any working day

- Formulate the problem as a LP problem.

18
Solution:
Let x1 = number of products of type A
x2 = number of products of type B
Objective:
- Profit of Rs.4 on type A , therefore 4x1 will be the profit on selling x1 units of type A
- Profit of Rs.5 on type B, therefore 5x2 will be the profit on selling x2 units of type B
Total profit,
z = 4x1 + 5x2
Constraints:

- Time constraint on machine X,


2x1 + 2x2 < 330 minutes
- Time constraint on machine Y,
3x1 + 2x2 < 480 minutes
- Non-negativity restrictions are,
x1 > 0 and x2 > 0

19
Complete LP model is,
Maximize z = 4x1 + 5x2

subject to
2x1 + 2x2 < 330 minutes
3x1 + 2x2 < 480 minutes
x1 > 0
x2 > 0

20

You might also like