Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
10 views

Graphical Method

Uploaded by

D. Naarayan Nandan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Graphical Method

Uploaded by

D. Naarayan Nandan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

R. A.

Podar College of Commerce and Economics


(Empowered Autonomous)
FYBCom Mathematical and Statistical Techniques I
Mathematical Applications in Management Worksheet 2
Q 1. Solve the following LPP by Graphical Method:
(A) A company makes two kinds of leather belts. Belt A is a high-quality belt and Belt B
is a low-quality. The respective profits are Rs 4 and Rs 3 per belt. Each belt of type
A requires twice as much time as a belt of type B, and if all belts were of type B, the
company could make 1000 per day. The supply of leather is sufficient for only 800 belts
per day. Belt A requires a fancy buckle and only 400 per day are available. There are
only 700 buckles a day available for belt B. Determine the optimal product mix.
(B) A farm is in breeding pigs. The pigs are fed on various products grown on the farm. In
view of the need to ensure certain constituents (call them X, Y, and Z), it is necessary
to buy two additional products say, A and B. One unit of product A contains 36 units of
X, 3 units of Y, and 20 units of Z. One unit of product B contains 6 units of X, 12 units
of Y, and 10 units of Z. Product A costs Rs. 20 per unit and product B Rs. 40 per unit.
Formulate the LPP and solve the problem using a graphical method.
(C) (F)
Maximize Z = 4x1 + 10x2
Minimize Z = −x1 + 2x2
Subject to 2x1 + x2 ≤ 50
Subject to − x1 + 3x2 ≤ 10
2x1 + 5x2 ≤ 100
x1 + x2 ≤ 6
2x1 + 3x2 ≤ 90
x1 − x2 ≤ 2
x1 , x2 ≥ 0
x1 , x2 ≥ 0
(D)
(G)
Maximize Z = 2x1 + 3x2
Subject to x1 + 2x2 ≤ 4 Maximize Z = 2x1 + 3x2
3x1 + 2x2 ≤ 6 Subject to x1 + 2x2 ≤ 30
x1 + x2 ≥ 5 x1 − x2 ≥ 0
x1 , x2 ≥ 0 x2 ≥ 3
(E) 0 ≤ x1 ≤ 20
Minimize Z = 400x1 + 360x2 0 ≤ x2 ≤ 12
Subject to 5x1 + 3x2 ≥ 45
x1 ≤ 8
x2 ≤ 10
x1 , x2 ≥ 0

xxxxxxxxxxx

You might also like