Ch 2: Linear Programming

By Mohamed Cherif

1
OR Ch2: Linear Programming
Exercise 1

Ozark Farms uses at least 800 lb of special feed daily. The special feed is a mixture of corn
and soybean meal with the following compositions:

The dietary requirements of the special feed are at least 30% protein
and at most 5% fiber. The goal is to determine the daily minimum-
cost feed mix.
2
OR Ch2: Linear Programming
Solution

1. Decision Variables

𝑋1 = lb of corn in the daily mix

𝑋2 = lb of soybean meal in the daily mix

2. Objective Function

Minimize z = .3 𝑋1 + .9 𝑋2

3
OR Ch2: Linear Programming
Structural Constraints Related to Resources
 The constraints represent the daily amount of the mix and the dietary requirements.
Ozark Farms needs at least 800 lb of feed a day—that is,
𝑋1 + X2 ≥ 800
 The amount of protein included in x1 lb of corn and X2 lb of soybean meal is (.09 𝑋1 +
.6 X2) lb. This quantity should equal at least 30% of the total feed mix (𝑋1 + X2) lb—
that is,
0.09 𝑋1 + .6 X2 ≥ .3(𝑋1 + X2)
0.09 𝑋1 + 0.6 X2 −0.30𝑋1 −0.30𝑋2 ≥0
− 0.21 𝑋1 + 0.30𝑋2 ≥0 (× −1)
0.21 𝑋1 − 0.30𝑋2 ≤ 0
 In a similar manner, the fiber requirement of at most 5% is represented as
.02 𝑋1 + .06 X2 ≤ .05(𝑋1 + X2)

4
OR Ch2: Linear Programming
 .02 𝑋1 + .06 X2 ≤ .05(𝑋1 + X2)

.02 𝑋1 + .06 X2 −0.05𝑋1 −0.05𝑋2 ≤ 0

−0.03𝑋1 + 0.01 𝑋2 ≤ 0 ( × −1)

0.03𝑋1 − 0.01 𝑋2 ≥ 0

5
OR Ch2: Linear Programming
The constraints are simplified by moving the terms in x1 and x2 to the left-hand side of each
inequality, leaving only a constant on the right-hand side. The complete model is

6
OR Ch2: Linear Programming
Graphical Solution

7
OR Ch2: Linear Programming
 𝑋1 + X2 = 800 (×0.30)
0.21 𝑋1 −0.30 X2 = 0

0.30𝑋1 + 0.30X2 = 240

0.21 𝑋1 −0.30 X2 = 0
0.51 𝑋1 =240
240
𝑋1 =0.51 = 470.58

𝑋1 + X2 = 800
X2 = 800-470.58=329.42

8
OR Ch2: Linear Programming
 𝑋1 + X2 = 800 (×0.01)
0.03 𝑋1 −0.01 X2 = 0

0. 𝟎𝟏𝑋1 + 0.01X2 = 8
0.03 𝑋1 −0.01 X2 = 0
0.04 𝑋1 =8
8
𝑋1 = = 200
0.04

𝑋1 + X2 = 800
X2 = 800−200=600

9
OR Ch2: Linear Programming
 Point Minimize z = .3 𝑋1 + .9 𝑋2
A (470.58,329.42) 0.3(470.58)+0.9(329.42)=$437.64 per day
B (200,600) 0.3(200)+0.9(600)=$600 per day

The minimum cost of the feed mix is (470.58,329.42)

10
OR Ch2: Linear Programming
First Example Using TORA APP

11
OR Ch2: Linear Programming
STEP 1: START TORA PROGRAM

12
OR Ch2: Linear Programming
STEP 2: SELECT LINEAR PROGRAMMING

13
OR Ch2: Linear Programming
STEP 3: INPUT OF DATA

14
OR Ch2: Linear Programming
STEP 4:

Next step is to click on the solve menu which displays an option whether we want to save
the data or not. And hence we can save the data for future evidence to take quick decision.

15
OR Ch2: Linear Programming
After saving, it displays a menu which asks that whether we want to solve it using
graphical method or algebraic method.

16
OR Ch2: Linear Programming
DATA

17
OR Ch2: Linear Programming
GRAPH

18
OR Ch2: Linear Programming
Optimum Solution

19
OR Ch2: Linear Programming
Exercise 2

A company produces two products, A and B. The sales volume for A is at least 80% of the

total sales of both A and B. However, the company cannot sell more than 110 units of A per

day. Both products use one raw material, of which the maximum daily availability is 300 lb.

The usage rates of the raw material are 2 lb per unit of A, and 4 lb per unit of B. The profit

units for A and B are $40 and $90, respectively. Determine the optimal product mix for the

company.

20
OR Ch2: Linear Programming
Solution

1. Decision Variables
X= number of produced product A
Y= number of produced product B

Maximum Raw
X Y
Material
Row Material 2 lb 4lb 300 lb
Profit 40 90

21
OR Ch2: Linear Programming
2. Objective Function

Maximize Z= 40 X + 90 Y

22
OR Ch2: Linear Programming
Structural Constraints Related to Resources

Constraint 1 : The sales volume for A is at least 80% of the total sales of both A and B
𝑋 ≥ 0.80 𝑋 + 𝑌
𝑋 − 0.80𝑋 − 0.80𝑌 ≥ 0
0.20𝑋 − 0.80𝑌 ≥ 0
Constraint 2: cannot sell more than 110 units of A per day
𝑋 ≤ 110

Constraint 3: Both products use one raw material, of which the maximum daily
availability is 300 lb. The usage rates of the raw material are 2 lb per unit of A, and 4 lb
per unit of B
2𝑋 + 4𝑌 ≤ 300

23
OR Ch2: Linear Programming
 Maximize Z= 40 𝑋 + 90 𝑌

Subject to
0.20𝑋 − 0.80𝑌 ≥ 0
𝑋 ≤ 110
2𝑋 + 4𝑌 ≤ 300
𝑋, 𝑌 ≥ 0 (Non negativity Constraint)

24
OR Ch2: Linear Programming
 0.20𝑋 − 0.80𝑌 = 0

X 0 1 2
Y 0 0.25 2

𝑋 = 110

X 110 110 110

Y 0 1 2

25
OR Ch2: Linear Programming
 2𝑋 + 4𝑌 = 300

X 0 150
Y 75 0

26
OR Ch2: Linear Programming
Graphical Solution

(1) 0.20𝑋 − 0.80𝑌 ≥ 0

(2) X ≤ 110
(3) 2𝑋 + 4𝑌 ≤ 300

D
C
A
B

27
OR Ch2: Linear Programming
 0.20𝑋 − 0.80𝑌 = 0 (× 100)
2𝑋 + 4𝑌 = 300 (× 10)

20𝑋 − 80𝑌 = 0
-
20𝑋 + 40𝑌 = 3000
−−−−−−−−−−−−−− −
−𝟏𝟐𝟎𝒀 = −𝟑𝟎𝟎0
3000
𝑦 = 120 =25
𝟐𝒙 + 𝟒(𝟐𝟓) = 𝟑𝟎𝟎
𝒙=100

28
OR Ch2: Linear Programming
 2𝑋 + 4𝑌 = 300
𝑋 = 110
300 − 220
𝑌= = 20
4

29
OR Ch2: Linear Programming
 Point (X,Y) Maximize Profit = 40 𝑋 + 90 𝑌
A (0.0) 0
B (110,0) 40(110)+0= 4400
D (100,25) 40(100)+90(25)=6250
C (110,20) 40(110)+90(20)=6200

The Point (100.25) that maximizes the profit of the company

30
OR Ch2: Linear Programming
Using Tora APP for Exercise 2

31
OR Ch2: Linear Programming
Graph

32
OR Ch2: Linear Programming
Optimum Solution

33
OR Ch2: Linear Programming
 Exercise 3
The manufacturing company engages in the
production of three distinct items, namely
Product A, Product B, and Product C. The
organization possesses a finite amount of
resources available for the production process.
Assuming a labor availability of 200 hours, the
production of each unit of Products A, B, and C
necessitates 2, 3, and 4 hours of labor,
respectively. The organization possesses a finite
quantity of raw materials, and the manufacturing
process for each unit of Product A, B, and C
requires 10, 5, and 8 units of the raw material,
respectively and raw material availability 500.
The corporation possesses finite resources and
aims to enhance its production strategy in order
to maximize profits, which amount to $5 per
unit of product A, $3 per unit of product B, and
$4 per unit of product C. 34
OR Ch2: Linear Programming
1.Decision Variables

𝒙𝟏 : The number of units of Product A to produce.

𝒙𝟐 : The number of units of Product B to produce.
𝒙𝟑 : The number of units of Product C to produce.

35
OR Ch2: Linear Programming
2.Objective Function

Maximize Z = 5 𝒙𝟏 + 3 𝒙𝟐 + 4 𝒙𝟑

36
OR Ch2: Linear Programming
3.Structural Constraints Related to Resources

Constraints 𝒙𝟏 𝒙𝟐 𝒙 Maximum
Resources
Labor 2 3 4 200
Raw Material 10 5 8 500

37
OR Ch2: Linear Programming
1. Labor constraint
2 𝒙𝟏 + 3 𝒙𝟐 + 4 𝒙𝟑 ≤ 200
2. Raw Material constraint
10 𝒙𝟏 + 5 𝒙𝟐 + 8 𝒙𝟑 ≤ 500
3. Non negativity constraint
𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 ≥0

38
OR Ch2: Linear Programming
 Maximize Z = 5 𝒙𝟏 + 3 𝒙𝟐 + 4 𝒙𝟑
Subject to
2 𝒙𝟏 + 3 𝒙𝟐 + 4 𝒙𝟑 ≤ 200
10 𝒙𝟏 + 5 𝒙𝟐 + 8 𝒙𝟑 ≤ 500
𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 ≥0

39
OR Ch2: Linear Programming
Exercise 4

40
OR Ch2: Linear Programming
Solution

First step: Graph the constraints as equations.

8𝑥 + 16𝑦 = 200

60𝑥 + 40𝑦 = 960

x 0 16
y 24 0

41
OR Ch2: Linear Programming
 Second Step: Shade feasible regions by taking into account the
inequality sign and its direction.
Third Step : Find the Corners of the Feasible Region.

42
OR Ch2: Linear Programming
Continue….

60𝑥 + 40𝑦 = 960

2 𝑥 + 2y = 40
Using elimination method, and multiply the second equation by -20
60𝑥 + 40𝑦 = 960
−40𝑥 − 40𝑦 = −800
Add two equations.
20x + 0 =160
X= 8
And substitute by (X= 8) in second equation.
2(8) + 2𝑦 = 40
16+2y=40
2y = 40 -16
2y= 24
Y=24\2 = 12 The point is (8,12)
43
OR Ch2: Linear Programming
Continue….

2𝑥 + 2𝑦 = 40
𝑥 + 2𝑦 = 25

Using elimination method and subtract the second equation from first.
x + 0 =15
X= 15
And substitute by X= 15 in second equation.
(15) + 2y = 25
2y= 10
Y= 10\2=5
The point is (15,5)

44
OR Ch2: Linear Programming
Continue….
Fourth Step: Evaluate the corners of the feasible solutions.

The point (8, 12) gives the least Cost which achieves optimal solution.

45
OR Ch2: Linear Programming
Solution by TORA APP

46
OR Ch2: Linear Programming
Graphical Solution

47
OR Ch2: Linear Programming
Optimum Solution

The Point That minimize cost is (8,12)

48
OR Ch2: Linear Programming
Any Question

49
OR Ch2: Linear Programming