MASTERS OF COMMERCE

APPLIED MATHEMATICS
ASSIGNMENT No. 2

Linear Programming

Prepared by: Rajab Ali Abdul Majeed

Section B

Date: Dec 12th, 2014

Page 1 of 12

Linear Programming Problems; graph the region of feasible

solution (if one exists) and solve by the corner point method.
Q 21)
Maximiz
e
subject
to

Z = 4x1 + 8x2
x1 + x2 20

2x1 + x2 32
x1, x2 0
Find constraints
C1 = x1 + x2 = 20
C1 = x1/20 + x2/20 = 1
C2 = 2x1 + x2 = 32
C2 = 2x1/32 + x2 /32 = 1
C2 = x1/16 + x2 /32 = 1
Put (0,0)
C1 = x1 + x2 20
C1 = 0 20 (True)
C2 =2x1 + x2 32
C2 = 0 32 (True)
Point B intersecting C1 & C2
x1 + x2 = 20
2x1 + x2 = 32
subtract the equation
-x1 = -12
X1 =
12
Put the value of x1 in C1
x1 + x2 = 20
12 + x2 = 20
Page 2 of 12

X2 =
8
Corners Z = 4x1 +
8x2
A (16, 0) 4 (16) + 8
(0)
B (12, 8) 4 (12) + 8
(8)
C (0, 20) 4 (0) + 8
(20)
D ( 0, 0) 4 (0) + 8
(0)

= 64
= 11
2
= 16
0
= 0

Maximum Z = 160 at C (0, 20) where X1 = 0 and X2 =

20

Page 3 of 12

Q 23)
Maximiz
e
subject
to

Z = 30x1 + 20x2
3x1 + x2 18

x1 + x2 12
x1 2
x2 5
x1, x2 0
Find constraints
C1 = 3x1 + x2 = 18
C1 = 3x1/18 + x2/18 = 1
C1 = x1/6 + x2/18
=1
C2 = x1 + x2 = 12
C2 = x1/12 + x2 /
12 = 1
C3 = x1 = 2
C3 = x1/2 =
1
C4 = x2 = 5
C4 = x2/5 =
1
Put (0,0)
C1 = 3x1 + x2 18
C1 = 0 18 (True)
C2 = x1 + x2 12
C2 = 0 12 (True)

Page 4 of 12

C3 = x1 2
C3 = 0 2 (False)
C4 =x2 5
C4 =0 5 (False)
Point B intersecting C2 & C3
X1 + X2 = 12
X1
= 2
subtract the equation
10
2

X2 =
X1 =

Point C intersecting C1 & C2

3x1 + x2 = 18
x1 + x2 = 12
subtract the equation
2x1 = 6
X1 =
3

X2 =

9
Point D intersecting C1 & C4
3x1 + x2 = 18
Since X2 = 5
Putting the value of X2 in C1
3x1 + 5 = 18
X1 =
13/3
Corners
A (2, 5)
Page 5 of 12

Z = 30x1 +
20x2
30 (2) + 20 (5)

= 160

B (2, 10)
C (3, 9)
D ( 13/3,
5)

30 (2) + 20 (10) = 260

30 (3) + 20 (9)
= 27
0
30 (13/3) + 20
= 230
(5)

Maximum Z = 270 at C (3, 9) where X1 = 3 and X2 = 9

Page 6 of 12

Q 33)

Department
1
Department
2
Profit
Margin

Product A

Product B

Weekly
Hour
60

80

$3 per
unit

$ 4 per
unit

a)Formulate Linear Programing model for determining the

Product Mix which maximize the Profit.
b)Solve using the corner point method
c) Fully interpret the results indicating the recommended
Product Mix. What percentage of daily capacity will be
utilized in each department?
Solution:
a)
Maximiz Z = 3x1 + 4x2
e
subject
2x1 + 3x2 60
to
4x1 + 2x2 80
x1, x2 0
b)
Find constraints
C1 = 2x1 + 3x2 = 60
C1 = 2x1/60 + 3x2/60 = 1
C1 = x1/30 +
x2/20 = 1
C2 = 4x1 + 2x2 = 80
C2 = 4x1/80 + 2x2/80 = 1

Page 7 of 12

C2 = x1/20 + x2 /
40 = 1
Put (0,0)
C1 = 2x1 + 3x2 60
C1 = 0 60 (True)
C2 = 4x1 + 2x2 80
C2 = 0 80 (True)
Point B intersecting C1 & C2
2x1 + 3x2 = 60
4x1 + 2x2 = 80(Multiply Eq.1 by 4 and Eq.2 by 2 and then subtract
the Equation)

8x1 + 12x2 = 240

8x1 + 4x2 = 160 (subtract the equation)
8x2 = 80
X2 =
10
Putting the value of X2 in C1
2x1 + 3x2 = 60
2x1 + 3(10) = 60
X1 =
15
Corners
A (20, 0)
B (15, 10)
C (0, 20)
D ( 0, 0)

Z = 3x1 + 4x2
3 (20) + 4 (0)
3 (15) + 4 (10)
3 (0) + 4 (20)
3 (0) + 4 (0)

= 60
= 85
= 80
= 0

b) Maximum Z = 85 at B (15, 10) where X1 = 15 and X2

= 10
c) Since profit will be maximized at $85/week; if 15 units of
Product A and 10 units of Product B will be produced and
Page 8 of 12

sold. In addition to this weekly labor capacity of both the

departments will be consumed in totality.

Page 9 of 12

Q) 35

Vitamin 1
Vitamin 2
Cost per oz

Food 1

Food 2

2 mg/oz
4 mg/oz
$0.12

3 mg/oz
2 mg/oz
$0.15

Min. daily
Req.
18 mg
22 mg

a)Formulate Linear Programing model for determining the

quantities of two foods which will minimize the cost of
the meal while ensuring that at least minimum levels of
both vitamins will be satisfied.
b)Solve ensuring corner-point method, indicating what the
minimum-cost meal will consist of and its cost. What
percentage of the minimum daily requirements for each
vitamin will be realized?
Solution:
a)
Minimiz Z = 0.12x1 + 0.15x2
e
subject
2x1 + 3x2 18
to
4x1 + 2x2 22
x1, x2 0
b)
Find constraints
C1 = 2x1 + 3x2 = 18
C1 = 2x1/18 + 3x2/18 = 1
C1 = x1/9 +
x2/6 = 1
C2 = 4x1 + 2x2 = 22
C2 = 4x1/22 + 2x2/22 = 1
C2 = x1/

11
2

x2 /11 = 1
Page 10 of 12

Put (0,0)
C1 = 2x1 + 3x2 18
C1 = 0 18 (False)
C2 = 4x1 + 2x2 22
C2 = 0 22 (False)

Page 11 of 12

Point B intersecting C1 & C2

2x1 + 3x2 = 18
4x1 + 2x2 = 22(Multiply Eq.1 by 4 and Eq.2 by 2 and then subtract
the Equation)

8x1 + 12x2 = 72
8x1 + 4x2 = 44
(subtract the equation)
8x2 = 28
X2 =
7/2
Putting the value of X2 in C1
2x1 + 3x2 = 18
2x1 + 3(7/2) = 18
X1 =
15/4
Corners
A (9, 0)
B(

15 7
,
4 2

C (0, 11)

Z = 0.12x1 +
0.15x2
0.12 (9) + 0.15 (0) = 1.08
0.12 (15/4) + 0.15
= 0.9
(7/2)
75
0.12 (0) + 0.15 (11) = 1.65

b) Minimum Z = 0.975 at B (

15 7
,
4 2

) where X1 = 15/4 or

3.75 and X2 = 7/2 or 3.5

Since cost will be minimized at $0.975 per meal; if 3.75
ounces of food 1 and 3.5 ounces of food 2 are served. 100 %
of Minimum daily requirement will be realized for both
vitamins.

Page 12 of 12