0% found this document useful (0 votes)
16 views

2.1-Linear-Programming-table-tips

owner:- indra prasad timsina

Uploaded by

bhujelaadesh7
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)
16 views

2.1-Linear-Programming-table-tips

owner:- indra prasad timsina

Uploaded by

bhujelaadesh7
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
You are on page 1/ 4

Note: For maximization case, we use (≤) sign whereas for

minimization case, (≥) is to be used.

Q. No. 5. a.

Item No. of units Cost per unit Profit per unit


A x Rs. 2,500 Rs. 600
B y Rs. 500 Rs. 200
Max. available 60 50,000 Total to be maximized
Let x and y be the quantity in pieces of item A and B respectively for
investment.
Maximize profit (P)=600x+200y subject to the constraints:
𝑥 + 𝑦 ≤ 60.
2,500𝑥 + 500𝑦 ≤ 50,000.
𝑤𝑖𝑡ℎ 𝑥 ≥ 0, 𝑦 ≥ 0.

Q. No. 5. b.
BA Cost per unit
Article X 8 6 Rs. 15
Article Y 10 2 Rs. 40
Min. requirement 28 36 Total cost to be minimized
Let x and y be the number of units of article X and Y produced
respectively.
Minimize cost (C)=15x+40y
Subject to the constraints:
4x+5y≥14
3x+y≥ 18
𝑥 ≥ 0, 𝑦 ≥ 0.
Q. No. 6. a. (Taught in class)

Q. No. 6. b.
Article Hrs of Machine Hrs of Machine Profit per unit
P Q
X 2 4 Rs. 30
Y 4 2 Rs. 40
Max. hours 24 24 Total to be
available maximized
Let 'x' units and 'y' units be the daily production of articles X and Y
respectively.
Maximize profit (P)= 30x + 40y
subject to the constraints:
2𝑥 + 4𝑦 ≤ 24 ⇒ 𝑥 + 2𝑦 ≤ 12.
4𝑥 + 2𝑦 ≤ 24 ⇒ 2𝑥 + 𝑦 ≤ 12 .
with 𝑥 ≥ 0, 𝑦 ≥ 0.

Q. No. 6. c.
Products Resource X Resource Y Resource Z Profit per unit
First 2 2 4 Rs. 20
Second 4 2 0 Rs. 30
Maximum Total to be
20 12 16
available maximized
Let x and y be the units of first and second product are the required
level of production.
Maximize profit (P)= 20x + 30y
subject to the constraints:
2𝑥 + 4𝑦 ≤ 20 ⇒ 𝑥 + 2𝑦 ≤ 10.
2𝑥 + 2𝑦 ≤ 12 ⇒ 𝑥 + 𝑦 ≤ 6.
4𝑥 + 0 × 𝑦 ≤ 16 ⇒ 𝑥 ≤ 4 .
with 𝑥 ≥ 0, 𝑦 ≥ 0.
Q. No. 6. d.
Cost per Available Profit per
Machine Floor area
day operator Machine
A 6 2 2 20
B 3 4 2 30
Maximum Total to be
360 280 160
available maximized
Let x and y be the units of first and second product are the required
level of production.
Maximize profit (P)= 20x + 30y
subject to the constraints:
6𝑥 + 3𝑦 ≤ 360 ⇒ 2𝑥 + 𝑦 ≤ 120.
2𝑥 + 4𝑦 ≤ 280 ⇒ 𝑥 + 2𝑦 ≤ 140.
2𝑥 + 2𝑦 ≤ 160 ⇒ 𝑥 + 𝑦 ≤ 80.
with 𝑥 ≥ 0, 𝑦 ≥ 0.

Q. No. 7. a.
Food
Vitamin Daily requirements
F1 F2
V1 2 4 40
V2 3 2 50
Cost per unit food Rs. 300 Rs. 500 Total cost to be minimized
Let x and y be the units of two kinds of foods with vitamins V1 and
V2 respectively.
Minimize cost (C)=300x+500y
Subject to the constraints:
2x+4y≥ 40
3x+2y≥ 50
𝑥 ≥ 0, 𝑦 ≥ 0.
Q. No. 7. b.
Ingredients Food A per gm. Food B per gm. Requirements.
X 10 units 3 units 49 units
Y 6 units 12 units 60 units
Z 3 units 1 unit Total to be minimized

Let x and y grams be the requirement of food A and B for animals


respectively.
Rewriting the given information in mathematical form:
Minimize Z = 3x + y subject to the constraints
10𝑥 + 3𝑦 ≥ 49.
6𝑥 + 12𝑦 ≥ 60.
with with 𝑥 ≥ 0, 𝑦 ≥ 0.

Q. No. 7. c.

Chemicals
Product Price
X Y Z
Liquid 5 2 1 Rs. 80
Dry 1 2 4 Rs. 100
Minimum required 10 12 12 Total to be minimized

Let x and y be the units of products of a liquid and dry nature


respectively.
Minimize cost C = 80x + 100y subject to the constraints
5𝑥 + 𝑦 ≥ 10.
𝑥 + 𝑦 ≥ 6.
𝑥 + 4𝑦 ≥ 12.
with 𝑥 ≥ 0, 𝑦 ≥ 0.

You might also like