University of Engineering & Technology

Taxila

Engineering Economics and Management

(EE&M)
Assignment 02

Submitted To:

Dr. Sadaqat Ali

Student Name:

Muhammad Hasnain Javed

22-EE-177 (C)

Department of Electrical Engineering, UET Taxila

 Assignment EE&M
PART A
Q:1
A merchant plans to sell two models of home computers at costs of $250 and $400, respectively.
The $250 model yields a profit of $45 and the $400 model yields a profit of $50. The merchant
estimates that the total monthly demand will not exceed 250 units. Find the number of units of
each model that should be stocked in order to maximize profit. Assume that the merchant does
not want to invest more than $70,000 in computer inventory.

Solution:
Let
x = number of $250 computers
y = number of $400 computers
Maximize:
P = 45x + 50y
Subject to:
250x + 400y ≤ 70000
x + y ≤ 250
x≥0
y≥0
Step 1: Convert inequalities to equations for corner points
1. 250x + 400y = 70000 → divide by 50 → 5x + 8y = 1400
2. x + y = 250
Solve equations pairwise:
From (1) and (2):
x + y = 250 → y = 250 - x
Substitute in 5x + 8y = 1400:
5x + 8(250 - x) = 1400
5x + 2000 - 8x = 1400
-3x = -600 → x = 200 → y = 50
Point: (200, 50)
Intersection with x-axis (y = 0) in 5x + 8y = 1400:
5x = 1400 → x = 280
Point: (280, 0)
Intersection with y-axis (x = 0) in 5x + 8y = 1400:
8y = 1400 → y = 175
Point: (0, 175)
Intersection with x-axis (y = 0) in x + y = 250:
x = 250 → (250, 0)
Intersection with y-axis (x = 0) in x + y = 250:
y = 250 → (0, 250)

2
Now test feasible points:
(200, 50) → P = 45(200) + 50(50) = 9000 + 2500 = 11500
(250, 0) → P = 45(250) = 11250
(0, 175) → P = 50(175) = 8750
(280, 0) is not feasible because 280 + 0 = 280 > 250
(0, 250) → 400(250) = 100,000 > 70,000 → not feasible
Maximum profit is at (200, 50), profit = 11500

Q:2
A fruit grower has 150 acres of land available to raise two crops, A and B. It takes one day to trim
an acre of crop A and two days to trim an acre of crop B, and there are 240 days per year available
for trimming. It takes 0.3 day to pick an acre of crop A and 0.1 day to pick an acre of crop B, and
there are 30 days per year available for picking. Find the number of acres of each fruit that should
be planted to maximize profit, assuming that the profit is $140 per acre for crop A and $235 per
acre for crop B.

Solution:

Let
x = acres of crop A
y = acres of crop B

Maximize:
P = 140x + 235y

Subject to:
x + y ≤ 150
x + 2y ≤ 240
0.3x + 0.1y ≤ 30
x ≥ 0, y ≥ 0

Convert constraints to equations:

1. x + y = 150
2. x + 2y = 240
3. 0.3x + 0.1y = 30 → 3x + y = 300

3
Solve (1) and (2):
From (1): y = 150 - x
Substitute into (2):
x + 2(150 - x) = 240 → x + 300 - 2x = 240 → -x = -60 → x = 60
y = 150 - 60 = 90 → Point: (60, 90)

Solve (1) and (3):

From (1): y = 150 - x
Substitute into (3):
3x + (150 - x) = 300 → 3x + 150 - x = 300 → 2x = 150 → x = 75
y = 150 - 75 = 75 → Point: (75, 75)

Solve (2) and (3):

x + 2y = 240
3x + y = 300

Multiply second by 2:
6x + 2y = 600
Now subtract:
(6x + 2y) - (x + 2y) = 600 - 240 → 5x = 360 → x = 72
Substitute: 3(72) + y = 300 → 216 + y = 300 → y = 84
Point: (72, 84)

Check feasibility:
(60, 90):
x + y = 150
x + 2y = 240
0.3x + 0.1y = 18 + 9 = 27 ≤ 30
P = 140(60) + 235(90) = 8400 + 21150 = $29,550

(75, 75):
x + y = 150
x + 2y = 225
0.3x + 0.1y = 30
P = 140(75) + 235(75) = 10500 + 17625 = $28,125

(72, 84):
x + y = 156 exceeds land limit

Conclusion:
Maximum profit is $29,550 when 60 acres of crop A and 90 acres of crop B are planted.

4
Q:3
A farming cooperative mixes two brands of cattle feed. Brand X costs $25 per bag and contains 2
units of nutritional element A, 2 units of element B, and 2 units of element C. Brand Y costs $20
per bag and contains 1 unit of nutritional element A, 9 units of element B, and 3 units of element
C. Find the number of bags of each brand that should be mixed to produce a mixture having a
minimum cost per bag. The minimum requirements of nutrients A, B, and C are 12 units, 36 units,
and 24 units, respectively.

Solution:
Let
x = bags of Brand X
y = bags of Brand Y
Minimize:
C = 25x + 20y
Subject to:
2x + y ≥ 12 (element A)
2x + 9y ≥ 36 (element B)
2x + 3y ≥ 24 (element C)
x ≥ 0, y ≥ 0
Solve pairwise:
(1) and (2):
2x + y = 12 → y = 12 - 2x
2x + 9(12 - 2x) = 36 → 2x + 108 - 18x = 36 → -16x = -72 → x = 4.5, y = 3
Not integer → discard
(1) and (3):
2x + y = 12 → y = 12 - 2x
2x + 3(12 - 2x) = 24 → 2x + 36 - 6x = 24 → -4x = -12 → x = 3, y = 6
Point: (3, 6)
(2) and (3):
2x + 9y = 36
2x + 3y = 24
Subtract: 6y = 12 → y = 2, then x = (36 - 18)/2 = 9
Point: (9, 2)
Check integer feasible points:
(3, 6):
2(3) + 6 = 12

5
2(3) + 9(6) = 60 ≥ 36
2(3) + 3(6) = 24
C = 25(3) + 20(6) = 75 + 120 = $195
(9, 2):
2(9) + 2 = 20 ≥ 12
2(9) + 9(2) = 18 + 18 = 54 ≥ 36
2(9) + 3(2) = 18 + 6 = 24
C = 25(9) + 20(2) = 225 + 40 = $265
Conclusion:
Minimum cost is $195 when 3 bags of Brand X and 6 bags of Brand Y are use.

Q:4
Two gasolines, type A and type B, have octane ratings of 80 and 92, respectively. Type A costs
$0.83 per liter and type B costs $0.98 per liter. Determine the blend of minimum cost with an
octane rating of at least 90. [Hint: Let x be the fraction of each liter that is type A and y be the
fraction that is type B.

Solution:
Let
x = fraction of type A gasoline
y = fraction of type B gasoline
Objective:
Minimize cost: C = 0.83x + 0.98y
Subject to:
x + y = 1 (since we're blending 1 liter total)
80x + 92y ≥ 90 (octane requirement)
x ≥ 0, y ≥ 0
Step 1: From x + y = 1 → x = 1 - y
Substitute into octane constraint:
80(1 - y) + 92y ≥ 90
80 - 80y + 92y ≥ 90

6
80 + 12y ≥ 90
12y ≥ 10 → y ≥ 5/6 ≈ 0.8333
Since x + y = 1, then x = 1 - 5/6 = 1/6
Minimum y = 5/6, maximum x = 1/6
Now compute cost:
C = 0.83(1/6) + 0.98(5/6) = 0.1383 + 0.8167 = $0.955 per liter
Conclusion:
Use 1/6 type A and 5/6 type B for a minimum cost of $0.955 per liter with at least 90 octane rating.

Q:5
PLANNING A FUNDRAISER Your club plans to raise money by selling two sizes of fruit baskets. The
plan is to buy small baskets for $10 and sell them for $16 and to buy large baskets for $15 and sell
them for $25. The club president estimates that you will not sell more than 100 baskets. Your club
can afford to spend up to $1200 to buy the baskets. Find the number of small and large fruit
baskets you should buy in order to maximize profit.

Solution:
Let
x = number of small baskets
y = number of large baskets
Profit per unit:
Small basket: 16 - 10 = $6
Large basket: 25 - 15 = $10
Objective:
Maximize profit: P = 6x + 10y
Subject to constraints:
x + y ≤ 100 (cannot sell more than 100 baskets)
10x + 15y ≤ 1200 (budget limit)
x ≥ 0, y ≥ 0

7
Convert constraints to equations to find corner points:
(1) x + y = 100 → y = 100 - x
(2) 10x + 15y = 1200 → divide by 5: 2x + 3y = 240 → y = (240 - 2x)/3
Find intersection of (1) and (2):
x + y = 100 → y = 100 - x
Substitute into (2):
10x + 15(100 - x) = 1200
10x + 1500 - 15x = 1200
-5x = -300 → x = 60
y = 40
→ Point: (60, 40)
Other intercepts:
x + y = 100 → (0, 100) and (100, 0)
10x + 15y = 1200:
If x = 0 → y = 80
If y = 0 → x = 120
So feasible intercepts: (0, 80), (100, 0)
Now evaluate profit at feasible corner points:
(0, 80): P = 6(0) + 10(80) = 800
(60, 40): P = 6(60) + 10(40) = 360 + 400 = 760
(100, 0): P = 6(100) + 10(0) = 600
Conclusion:
Maximum profit is $800 when the club buys 0 small baskets and 80 large baskets.

Q:6
JUICE BLENDS A juice company makes two kinds of juice: Orangeade and Berry-fruity. One gallon of
Orangeade is made by mixing 2.5 quarts of orange juice and 1.5 quarts of raspberry juice, while
one gallon of Berry-fruity is made by mixing 3 quarts of raspberry juice and 1 quart of orange juice.
A profit of $.50 is made on every gallon of Orangeade sold, and a profit of $.40 is made on every
gallon of Berry-fruity sold. If the company has 150 gallons of raspberry juice and 125 gallons of
orange juice on hand, how many gallons of each type of juice should be made to maximize profit?

Solution:

8
Let
x = gallons of Orangeade
y = gallons of Berry-fruity
Each gallon of juice uses quarts, so first convert total supply to quarts:
150 gallons raspberry juice = 600 quarts
125 gallons orange juice = 500 quarts
Constraints (in quarts):
Orangeade uses: 2.5 quarts orange, 1.5 quarts raspberry
Berry-fruity uses: 1 quart orange, 3 quarts raspberry
So:
Orange juice constraint:
2.5x + 1y ≤ 500
Raspberry juice constraint:
1.5x + 3y ≤ 600
Profit function:
Maximize P = 0.50x + 0.40y
Subject to:
2.5x + y ≤ 500
1.5x + 3y ≤ 600
x ≥ 0, y ≥ 0
Solve system to find corner points:
(1) 2.5x + y = 500 → y = 500 - 2.5x
(2) 1.5x + 3y = 600
Substitute y from (1) into (2):
1.5x + 3(500 - 2.5x) = 600
1.5x + 1500 - 7.5x = 600
-6x = -900 → x = 150
y = 500 - 2.5(150) = 125
→ Point: (150, 125)
Check intercepts:
(2.5x + y = 500):
If x = 0 → y = 500
If y = 0 → x = 200 → (200, 0)
(1.5x + 3y = 600):
If x = 0 → y = 200
If y = 0 → x = 400 → (400, 0)
Feasible points:
(0, 200): P = 0.50(0) + 0.40(200) = 80
(150, 125): P = 0.50(150) + 0.40(125) = 75 + 50 = 125
(200, 0): 1.5(200) + 3(0) = 300 ≤ 600 → P = 0.50(200) = 100
(0, 500): violates raspberry juice constraint
Conclusion:
Maximum profit is $125 when the company produces 150 gallons of Orangeade and 125 gallons of
Berry-fruity.

9
Q:7
FILE CABINETS An office manager is purchasing file cabinets and wants to maximize storage space.
The office has 60 square feet of floor space for the cabinets and $600 in the budget to purchase
them. Cabinet A requires 3 square feet of floor space, has a storage capacity of 12 cubic feet, and
costs $75. Cabinet B requires 6 square feet of floor space, has a storage capacity of 18 cubic feet,
and costs $50. How many of each cabinet should the office manager buy?

Solution:
Let
x = number of Cabinet A
y = number of Cabinet B
Objective:
Maximize storage: S = 12x + 18y
Subject to constraints:
Floor space: 3x + 6y ≤ 60
Cost: 75x + 50y ≤ 600
x ≥ 0, y ≥ 0
Simplify floor constraint:
3x + 6y ≤ 60 → x + 2y ≤ 20
Also write cost constraint as is.
Solve system:
(1) x + 2y = 20 → y = (20 - x)/2
(2) 75x + 50y = 600 → y = (600 - 75x)/50
Substitute y from (1) into (2):
75x + 50((20 - x)/2) = 600
75x + 25(20 - x) = 600
75x + 500 - 25x = 600
50x = 100 → x = 2
Then y = (20 - 2)/2 = 9
→ Point: (2, 9)

10
Other intercepts:
From (1):
x = 0 → y = 10
y = 0 → x = 20
From (2):
x = 0 → y = 12
y=0→x=8
Feasible integer points:
(0, 10): S = 12(0) + 18(10) = 180
(2, 9): S = 12(2) + 18(9) = 24 + 162 = 186
(4, 8): Check:
x + 2y = 4 + 16 = 20
75x + 50y = 300 + 400 = 700
(6, 7): x + 2y = 20, cost = 75×6 + 50×7 = 450 + 350 = 800
(8, 6): x + 2y = 8 + 12 = 20, cost = 75×8 + 50×6 = 600 + 300 = 900
(2, 9) is best feasible point
Conclusion:
Maximum storage is 186 cubic feet when the manager buys 2 Cabinet A and 9 Cabinet B

11
 Assignment EE&M
PART B
Q:1
You have 180 tomatoes, and 15 onions left over from your garden. You want to use these to make
jars of tomato sauce and jars of salsa to sell at a farm stand. A jar of tomato sauce requires 10
tomatoes and 1 onion, and a jar of salsa requires 5 tomatoes and 14 onions. You’ll make a profit of
$2 on every jar of tomato sauce sold and a profit of $1.50 on every jar of salsa sold. The farm stand
wants at least three times as many jars of tomato sauce as jars of salsa. How many jars of each
should you make to maximize profit?

Solution:
Let:
x = number of jars of tomato sauce
y = number of jars of salsa
Objective function:
Maximize: Z=2x+1.5yZ = 2x + 1.5yZ=2x+1.5y
Subject to the constraints:
10x+5y≤180 (tomato constraint)
x+1.25y≤15x (onion constraint)
x≥3y (farm stand constraint)
x≥0, y≥0
Now, solve this system of inequalities to find the feasible region and determine the number of jars of
tomato sauce and salsa that maximizes the profit.
Tomato constraint:
10x+5y≤180
Dividing by 5:
2x+y≤36
Onion constraint:
x+1.25y≤15
Multiply by 4 to eliminate decimals:
4x+5y≤60
Farm stand constraint:
x≥3y

12
Q:2
You have 30 tokens for playing video games and pinball. It cost 3 tokens to play a video game and 2
tokens to play pinball. You want to play an equal number of video games and pinball games. Use
an algebraic model to find how many games each you can play.

Solution:
Let:
x = number of video games played
y = number of pinball games played
Objective:
Play an equal number of video games and pinball games, so we have the constraint:
x=y
Subject to:
3x+2y=30 (token constraint)
x≥0, y≥0 (non-negative constraint)
Solve for x
Substitute y with x in the token constraint:
3x+2x=30
5x=30
x=6
Step 2: Solve for y
Since x=y, we also have:
y=6
Final Answer:
You can play 6 video games and 6 pinball games to use up all 30 tokens.

13
 Ke

Q:3
You are stenciling wooden boxes to sell at a fair. It takes you 2 hours to stencil a small box and 3
hours to stencil a large box. You make a profit of $10 for a small box and $20 for a large box. If you
have no more than 30 hours available to stencil and want at least 12 boxes to sell, how many of each
size boxes should you stencil to maximize your profit?

Solution:
Let:
x = number of small boxes stencilled
y = number of large boxes stencilled
Objective function:
Maximize Z=10x+20y (profit from small and large boxes)
Subject to the constraints:
2x+3y≤30 (time constraint)
x+y≥12 (minimum number of boxes)
x≥0, y≥0 (non-negative constraints)
Step 1: Graph the Constraints
Let's rewrite the constraints in a way that makes it easier to graph:
2x+3y=30 (time constraint)
x+y=12 (minimum number of boxes)
Step 2: Find the Corner Points
Solve the system of equations formed by the constraints and then evaluate the objective function
Z=10x+20y at the corner points of the feasible region.

14
Q:4
Vern decides to adopt a vegetarian diet consisting of fruits, grains and vegetables. His minimum daily
requirements are 14 units of protein, 16 units of carbohydrates, and 12 units of fiber. Suppose a
serving of fruits can supply him with 1 unit of protein, 2 units of carbohydrates and 1 unit of fiber
while a serving of grains provides 3 units of protein, 2 units of carbohydrates, and 3 units of fiber. A
serving of vegetables provides 4 units of protein, 3 units of carbohydrates and 2 units of fiber. If fruit
costs 30¢ per serving, grains cost 60¢ per serving and vegetables cost 70¢ per serving, how many
servings of each type of food should he eat per day in order to satisfy his daily food requirements at
minimum cost?

Solution:
Let:
x = number of servings of fruits
y = number of servings of grains
z = number of servings of vegetables
Objective function (minimize the cost):
Minimize Z=30x+60y+70z
Subject to the constraints:
Protein constraint:
x+3y+4z≥14
Carbohydrate constraint:
2x+2y+3z≥16
Fiber constraint:
x+3y+2z≥12
Non-negativity constraints:
x≥0, y≥0, z≥0
Graph the Constraints
Let's plot the constraints to find the feasible region and identify the corner points.
Now, let's graph the constraints and solve this problem.

15
Q:5
Michigan Polar Products makes downhill and cross-country skis. A pair of downhill skis requires 2
man-hours for cutting, 1 man-hour for shaping and 3 man-hours for finishing while a pair of cross-
country skis requires 2 man-hours for cutting, 2 man-hours for shaping and 1 man-hour for
finishing. Each day the company has available 140 man-hours for cutting, 120 man-hours for
shaping and 150 man-hours for finishing. How many pairs of each type of ski should the company
manufacture each day in order to maximize profit if a pair of downhill skis yields a profit of $10
and a pair of cross-country skis yields a profit of $8?

Solution:
Let:
x = number of pairs of downhill skis
y = number of pairs of cross-country skis
Objective function (maximize profit):
Maximize Z=10x+8y
Subject to the constraints:
Cutting constraint:
2x+2y≤140
Shaping constraint:
x+2y≤120
Finishing constraint:
3x+y≤150
Non-negativity constraints:
x≥0, y≥0
Graph the Constraints
We can graph the constraints to find the feasible region and then identify the corner points.
Let's graph the constraints and solve this problem.

16
Q:6
A dietitian wants to design a breakfast menu for certain hospital patients. The menu is to include
two items, A and B. Suppose that each ounce of A provides 2 units of vitamin C and 2 units of iron,
and each ounce of B provides 1 unit of vitamin C and 2 units of iron. Suppose the cost of A is
4¢/ounce and the cost of B is 3¢/ounce. If the breakfast menu must provide at least 8 units of
vitamin C and 10 units of iron, how many ounces of each item should be provided to meet the iron
and vitamin C requirements for the least cost? What will this breakfast cost?

Solution:
Let:
x = number of ounces of item A
y = number of ounces of item B
Objective function (minimize cost):
Minimize Z=4x+3y
Subject to the constraints:
Vitamin C constraint:
2x+y≥8 (because each ounce of A provides 2 units of vitamin C, and each ounce of B provides 1 unit)
Iron constraint:
2x+2y≥10 (because each ounce of A provides 2 units of iron, and each ounce of B provides 2 units)
Non-negativity constraints:
x≥0, y≥0
Graph the Constraints
We will plot the constraints and identify the feasible region where all the constraints are satisfied.
Then we will evaluate the objective function at the corner points of the feasible region to minimize
the cost.
Let's graph the constraints and solve this problem.

17
Q:7
A small business makes 3-speed and 10-speed bicycles at two different factories. Factory A
produces 16 3-speed and 20 10-speed bikes in one day while factory B produces 12 3-speed and 20
10-speed bikes daily. It costs $1000/day to operate factory A and $800/day to operate factory B.
An order for 96 3-speed bikes and 140 10-speed bikes has just arrived. How many days should each
factory be operated to fill this order at a minimum cost? What is the minimum cost?

Solution:
Let:
x = number of days factory A operates
y = number of days factory B operates
Objective function (minimize cost):
Minimize Z=1000x+800y
Subject to the constraints:
3-speed bike constraint:
16x+12y≥96(since factory A makes 16 3-speed bikes per day and factory B makes 12 per day)
10-speed bike constraint:
20x+20y≥140 (since factory A makes 20 10-speed bikes per day and factory B also makes 20 per day)
Non-negativity constraints:
x≥0, y≥0
Graph the Constraints
We will plot the constraints to find the feasible region and determine the corner points. Then, we can
evaluate the objective function at these points to minimize the cost.

18
Q:8
A farmer wants to customize his fertilizer for his current crop. He can buy plant food mix A and
plant food mix B. Each cubic yard of food A contains 20 pounds of phosphoric acid, 30 pounds of
nitrogen and 5 pounds of potash. Each cubic yard contains 10 pounds of phosphoric acid, 30
pounds of nitrogen and 10 pounds of potash. He requires a minimum of 460 pounds of phosphoric
acid, 960 pounds of nitrogen and 220 pounds of potash. If food A costs $30 per cubic yard and food
B costs $35 per cubic yard, how many cubic yards of each food should the farmer blend to meet
the minimum chemical requirements at a minimal cost? What is this cost?

Solution:
Let:
x = number of cubic yards of food A
y = number of cubic yards of food B
Objective function (minimize cost):
Minimize Z=30x+35y
Subject to the constraints:
Phosphoric acid constraint:
20x+10y≥460
Nitrogen constraint:
30x+30y≥960
Potash constraint:
5x+10y≥220
Non-negativity constraints:
x≥0, y≥0
Graph the Constraints
We will plot the constraints to find the feasible region and determine the corner points. Then, we can
evaluate the objective function at these points to minimize the cost.
Let's graph the constraints and solve this problem.

19
20
 Assignment EE&M
PART C
Q:1
A diet-conscious housewife wishes to ensure her family's daily intake of vitamins A, B and C does
not fall below certain levels, say 24 units, 30 units and 18 units, respectively. For this she relies on
two fresh foods which, respectively, provide 8, 5 and 2 units of vitamins per ounce of foodstuff and
3, 6 and 9 units per ounce. If the first foodstuff costs 3p per ounce and the second only 2p per
ounce, use a graphical method to find how many ounces of each foodstuff should be bought by the
housewife daily in order to keep her food bill as low as possible.

Solution:
Minimum vitamin intake is
Vitamin A ≥ 24 units
Vitamin B ≥ 30 units
Vitamin C ≥ 18 units
Food contents per ounce are
Food 1: 8A, 5B, 2C (cost 3p)
Food 2: 3A, 6B, 9C (cost 2p)
Let:
x = ounces of Food 1
y = ounces of Food 2
Objective function:
Minimize Z = 3x + 2y
Subject to constraints:
8x + 3y ≥ 24
5x + 6y ≥ 30
2x + 9y ≥ 18
x ≥ 0, y ≥ 0
Corner points of feasible region (from graph):
A = (1.636, 3.64)
B = (2.45, 1.455)
C = (4.91, 0.91)
Evaluate Z at each point:
At A: Z = 3(1.636) + 2(3.64) = 4.908 + 7.28 = 12.188
At B: Z = 3(2.45) + 2(1.455) = 7.35 + 2.91 = 10.26
At C: Z = 3(4.91) + 2(0.91) = 14.73 + 1.82 = 16.55
Minimum cost at B (2.45, 1.455)
x = 2.45 ounces
y = 1.455 ounces
Minimum cost = 10.26 pence

21
Q:2
A small mine works two coal seams and produces three grades of coal. It costs £10 an hour to work
the upper seam, obtaining in that time 1 tonne of anthracite, 5 tonnes of best quality coal and 2
tonnes of ordinary coal. The lower seam is more expensive to work, at a cost of £15 per hour, but it
yields in that time 4 tonnes of anthracite, 6 tonnes of best coal and 1 tonne of ordinary coal. Faced
with just one order, for 8 tonnes of anthracite, 30 tonnes of best coal and 8 tonnes of ordinary
coal, how many hours should each seam be worked so as to fill this order as cheaply as possible?

Solution:
Given order requirements:
Anthracite ≥ 8 tonnes
Best coal ≥ 30 tonnes
Ordinary coal ≥ 8 tonnes
Upper seam (per hour, £10 cost):
1A, 5B, 2O
Lower seam (per hour, £15 cost):
4A, 6B, 1O
Let:
x = hours of upper seam
y = hours of lower seam
Objective function:
Minimize Z = 10x + 15y
Subject to constraints:
1x + 4y ≥ 8
5x + 6y ≥ 30
2x + 1y ≥ 8
x ≥ 0, y ≥ 0
Corner points of feasible region (from graph):
A = (4.615, 0.923)

22
B = (1.333, 3.333)
C = (5.714, 0.571)
Evaluate Z at each point:
At A: Z = 10(4.615) + 15(0.923) = 46.15 + 13.845 = 59.995
At B: Z = 10(1.333) + 15(3.333) = 13.33 + 49.995 = 63.325
At C: Z = 10(5.714) + 15(0.571) = 57.14 + 8.565 = 65.705
Minimum cost at A (4.615, 0.923)
x = 4.615 hours
y = 0.923 hours
Minimum cost = £59.995

Q:3
A landscape designer has £200 to spend on planting trees and shrubs to landscape an area of 1000
m². For a tree he plans to allow 25 m² and for a shrub 10 m². Planting a tree will cost £2 and a
shrub £5. If he plants 30 shrubs what is the maximum number of trees he can plant? If he plants 3
shrubs for every tree, what is the maximum number of trees he can plant?

Solution:
Let
x = number of trees
y = number of shrubs
Constraints:
Area: 25x + 10y ≤ 1000
Cost: 2x + 5y ≤ 200
Part 1: If he plants 30 shrubs
Given: y = 30
Substitute into constraints

23
Area:
25x + 10(30) ≤ 1000
25x + 300 ≤ 1000
25x ≤ 700
x ≤ 28
Cost:
2x + 5(30) ≤ 200
2x + 150 ≤ 200
2x ≤ 50
x ≤ 25
So, maximum number of trees = 25
Part 2: If he plants 3 shrubs for every tree
Given: y = 3x
Substitute into constraints
Area:
25x + 10(3x) ≤ 1000
25x + 30x ≤ 1000
55x ≤ 1000
x ≤ 18.18
Cost:
2x + 5(3x) ≤ 200
2x + 15x ≤ 200
17x ≤ 200
x ≤ 11.76
So, maximum number of trees = 11 (integer)
Final Answers:
(i) If 30 shrubs are planted; Maximum trees = 25
(ii) If shrubs are 3 times trees; Maximum trees = 11

24
Q:4
In laying out a car park it is decided, in the hope of making the best use of the available parking
space (7200 sq.ft.), to have some spaces for small cars, the rest for large cars. For each small space
90 sq.ft. is allowed, for each large space 120 sq.ft. Every car must occupy a space of the
appropriate size. It is reliably estimated that, of the cars wishing to park at any given time, the
ratio of small to large will be neither less that 2:3 nor greater than 2:1. Find the number of spaces
of each type in order to maximise the number of cars that can be parked.

Solution:
Let
x = number of small car spaces
y = number of large car spaces
Constraints:
3x + 4y = 240 (area constraint)
2y ≤ 3x (ratio constraint 1)
x ≤ 2y (ratio constraint 2)
Objective: Maximize x + y
From 3x + 4y = 240:
3x = 240 - 4y
x = (240 - 4y)/3
Substitute into ratio constraints:
For 2y ≤ 3x, we get 2y ≤ 240 - 4y, which simplifies to 6y ≤ 240, so y ≤ 40.
For x ≤ 2y, we get (240 - 4y)/3 ≤ 2y, which simplifies to 240 ≤ 10y, so y ≥ 24.
Therefore, 24 ≤ y ≤ 40. Now, substitute into 3x + 4y = 240:
If y = 24, x = (240 - 4(24))/3 = 64
If y = 40, x = (240 - 4(40))/3 = 40
To maximize x + y, choose y = 40 and x = 40.
So, the maximum number of cars that can be parked is 40 + 40 = 80.
Final Answer:
The maximum number of cars is 80.

25
Q:5
A firm manufactures two types of box, each requiring the same amount of material. They both go
through a folding machine and a stapling machine. Type A boxes require 4 seconds on the folding
machine and 3 seconds on the stapling machine. Type B boxes require 2 seconds on the folding
machine and 7 seconds on the stapling machine. Each machine is available for 1 hour. There is a
profit of 40p on Type A boxes and 30p on Type B boxes. How many of each type should be made to
maximise the profit?

Solution:
Let x be the number of Type A boxes and y be the number of Type B boxes.
Folding machine constraint is 4x + 2y ≤ 360.
Stapling machine constraint is 3x + 7y ≤ 360.
Objective is to maximize profit P = 40x + 30y.
Convert folding constraint to equation 4x + 2y = 360.
Divide by 2 to get 2x + y = 180.
So y = 180 - 2x.
Substitute y into the second constraint.
3x + 7(180 - 2x) = 360
3x + 1260 - 14x = 360
-11x = -900
x = 81.82
y = 180 - 2(81.82) = 16.36
Now evaluate profit at feasible points;
At (0, 0); profit is 40(0) + 30(0) = 0
At (90, 0); check constraints,
4(90) + 2(0) = 360
3(90) + 7(0) = 270
Profit is 40(90) + 30(0) = 3600
At (0, 51.43); from 3x + 7y = 360,
Check folding constraint,
4(0) + 2(51.43) = 102.86
Profit is 40(0) + 30(51.43) = 1542.86
At (45, 90);
4(45) + 2(90) = 360
3(45) + 7(90) = 135 + 630 = 765 (not feasible)
So the only valid maximum is at (90, 0)
Final answer is the firm should make 90 Type A boxes and 0 Type B boxes for maximum profit of
3600 pence.

26
Q:6
The numbers of units of vitamins A, B and C in a kilogram of foods X and Y are as follows:
Food Vitamin A Vitamin B Vitamin C
X 5 2 6
Y 4 6 2
A mixture of the two foods is made which has to contain at least 20 units of vitamin A, at least 24
units of vitamin B and at least 12 units of vitamin C.
1. Find the smallest total amount of X and Y to satisfy these constraints.
2. Food Y is three times as expensive as Food X. Find the amounts of each to minimise the
cost and satisfy the constraints.

Solution:
Let x be the kilograms of Food X and y be the kilograms of Food Y;
Vitamin A constraint is 5x + 4y ≥ 20.
Vitamin B constraint is 2x + 6y ≥ 24.
Vitamin C constraint is 6x + 2y ≥ 12.
Objective for minimum total weight is minimize x + y.
Convert constraints to equalities to find corner points,
First solve 5x + 4y = 20 and 2x + 6y = 24,
Multiply first by 3 and second by 2,
15x + 12y = 60
4x + 12y = 48
Subtract,
11x = 12
x = 1.09
Substitute into 5x + 4y = 20,
5(1.09) + 4y = 20
5.45 + 4y = 20

27
4y = 14.55
y = 3.64
Now solve 5x + 4y = 20 and 6x + 2y = 12,
Multiply first by 1 and second by 2,
5x + 4y = 20
12x + 4y = 24
Subtract,
7x = 4
x = 0.57
Substitute into 5x + 4y = 20,
5(0.57) + 4y = 20
2.85 + 4y = 20
4y = 17.15
y = 4.29
Now solve 2x + 6y = 24 and 6x + 2y = 12,
Multiply first by 1 and second by 3,
2x + 6y = 24
18x + 6y = 36
Subtract,
16x = 12
x = 0.75
Substitute into 2x + 6y = 24,
2(0.75) + 6y = 24
1.5 + 6y = 24
6y = 22.5
y = 3.75
Evaluate x + y at points,
(1.09 + 3.64) = 4.73
(0.57 + 4.29) = 4.86
(0.75 + 3.75) = 4.5
Minimum total weight is 4.5 at point (0.75, 3.75).
Now to minimize cost,
Cost function is C = x + 3y.
Evaluate at same points,
At (1.09, 3.64); cost = 1.09 + 3(3.64) = 11.01,
At (0.57, 4.29); cost = 0.57 + 3(4.29) = 13.44,
At (0.75, 3.75); cost = 0.75 + 3(3.75) = 12.0,
Minimum cost is 11.01 at point (1.09, 3.64).
Final answer is minimum total weight is 4.5 kg at 0.75 kg of X and 3.75 kg of Y.
Minimum cost is 11.01 at 1.09 kg of X and 3.64 kg of Y.

28
Q:7
The annual subscription for a tennis club is £20 for adults and £8 for juniors. The club needs to
raise at least £800 in subscriptions to cover its expenses. The total number of members is
restricted to 50. The number of junior members is to be between one quarter and one third of the
number of adult members. Represent the information graphically and find the numbers of adult
and junior members which will bring in the largest amount of money in subscriptions. Find also the
least total membership which will satisfy the conditions.

Solution:
Let A be the number of adult members and J be the number of junior members.
Revenue constraint is 20A + 8J ≥ 800.
Total members constraint is A + J ≤ 50.
Junior ratio constraints are A/4 ≤ J ≤ A/3.
Convert equalities to find corner points,
From 20A + 8J = 800 and J = A/4,
Substitute J,
20A + 8(A/4) = 800
20A + 2A = 800
22A = 800
A = 36.36
J = 36.36 / 4 = 9.09
From 20A + 8J = 800 and J = A/3,
Substitute J,
20A + 8(A/3) = 800
20A + 8A/3 = 800
Multiply by 3,
60A + 8A = 2400
68A = 2400
A = 35.29
J = 35.29 / 3 = 11.76

29
From A + J = 50 and J = A/4,
Substitute J,
A + A/4 = 50
1.25A = 50
A = 40
J = 10
From A + J = 50 and J = A/3,
Substitute J,
A + A/3 = 50
1.33A = 50
A = 37.5
J = 12.5
Now evaluate revenue 20A + 8J at all feasible points,
(36.36, 9.09); revenue = 20(36.36) + 8(9.09) = 727.27 + 72.72 = 800
(35.29, 11.76); revenue = 20(35.29) + 8(11.76) = 705.88 + 94.08 = 799.96
(40, 10); revenue = 20(40) + 8(10) = 800 + 80 = 880
(37.5, 12.5); revenue = 20(37.5) + 8(12.5) = 750 + 100 = 850
Maximum revenue is 880 at (40, 10).
Now evaluate total membership A + J for least membership satisfying conditions and revenue at least
800.
(36.36, 9.09); total = 45.45
(35.29, 11.76); total = 47.05
(40, 10); total = 50
(37.5, 12.5); total = 50
Least total membership satisfying all conditions and revenue is 45.45 from (36.36, 9.09)
Final answer is the club should have 40 adult members and 10 junior members for maximum
revenue of 880 pounds
Minimum total membership to meet conditions is 45.45 members with 36.36 adults and 9.09
juniors.

30
 Assignment EE&M
PART D
Q:1
A farmer has 20 hectares for growing barley and swedes. The farmer has to decide how much of
each to grow. The cost per hectare for barley is £30 and for swedes is £20. The farmer has
budgeted £480.Barley requires 1 man-day per hectare and swedes require 2 man-days per
hectare. There are 36 man-days available.The profit on barley is £100 per hectare and on swedes is
£120 per hectare.Find the number of hectares of each crop the farmer should sow to maximise
profits.
Solution:
Let x = hectares of barley, y = hectares of swedes
Objective: Maximize profit P = 100x + 120y
Subject to:
x + y ≤ 20
30x + 20y ≤ 480
x + 2y ≤ 36
x ≥ 0, y ≥ 0
Find intersections:
x + y = 20 and 3x + 2y = 48 → (8, 12)
x + y = 20 and x + 2y = 36 → (4, 16)
3x + 2y = 48 and x + 2y = 36 → (6, 15)
Check feasibility:
(8, 12) satisfies all constraints → P = 100×8 + 120×12 = 800 + 1440 = 2240
(4, 16) violates budget constraint (cost = 520)
(6, 15) violates land constraint (x + y = 21)
(0, 18) satisfies all constraints → P = 0 + 120×18 = 2160
Maximum profit = £2240 at (8, 12)
So, farmer should grow 8 hectares of barley and 12 hectares of swedes

31
Q:2
A small firm builds two types of garden shed.
Type A requires 2 hours of machine time and 5 hours of craftsman time.
Type B requires 3 hours of machine time and 5 hours of craftsman time.
Each day there are 30 hours of machine time available and 60 hours of craftsman time.
The profit on each type A shed is £60 and on each type B shed is £84.
Formulate the appropriate linear programming problem.

Solution:
Let x = number of Type A sheds, y = number of Type B sheds
Objective: Maximize profit P = 60x + 84y
Subject to:
2x + 3y ≤ 30
x + y ≤ 12
x ≥ 0, y ≥ 0

Intersection of constraints:
From x + y = 12 and 2x + 3y = 30 → x = 6, y = 6
Other feasible points: (0,10), (12,0)

Profit at (0,10): P = 0 + 840 = 840

Profit at (6,6): P = 360 + 504 = 864
Profit at (12,0): P = 720 + 0 = 720

Maximum profit = £864 at (6,6)

So, firm should build 6 Type A sheds and 6 Type B sheds

Q:3
Suppose a manufacturer of printed circuits has a stock of:
200 resistors, 120 transistors, 150 capacitors, and is required to produce two types of circuits.
Type A requires:

32
20 resistors, 10 transistors, 10 capacitors.
Type B requires:
10 resistors, 20 transistors, 30 capacitors.
If the profit on type A circuits is £5 and on type B circuits is £12, how many of each circuit should
be produced to maximize the profit?

Solution:
Let:
x = number of type A circuits produced
y = number of type B circuits produced
Objective function (maximize profit):
Maximize Z=5x+12y
Subject to the constraints:
Resistor constraint:
20x+10y≤200
Transistor constraint:
10x+20y≤120
Capacitor constraint:
10x+30y≤150
Non-negativity constraints:
x≥0, y≥0
Graph the Constraints
Let's plot the constraints and find the feasible region. Then we can evaluate the objective function at
the corner points to maximize the profit.

33
Q:4
A factory employs unskilled workers earning £135 per week and skilled workers earning £270 per
week. It is required to keep the weekly wage bill below £24,300. The machines require a minimum
of 110 operators, of whom at least 40 must be skilled. Union regulations require that the number
of skilled workers should be at least half the number of unskilled workers. If x is the number of
unskilled workers and y the number of skilled workers, write down all the constraints to be
satisfied by x and y.

Solution:
Let:
x = number of unskilled workers
y = number of skilled workers
Objective function:
Minimize the total wage bill, which is:
Wage Bill=135x+270y
with the constraint:
135x+270y≤24,300
Subject to the following constraints:
Total number of operators:
x+y≥110 (since the factory needs at least 110 operators)
At least 40 skilled workers:
y≥40 (since at least 40 workers must be skilled)
Skilled workers at least half of unskilled workers:
y≥1/2x (union regulations require skilled workers to be at least half the number of unskilled workers)
Non-negativity constraints:
x≥0, y≥0 (the number of workers cannot be negative)
These are the constraints that the number of unskilled workers (xxx) and skilled workers (y) must
satisfy.

34
Q:5
A firm manufactures wood screws and metal screws. All the screws have to pass through a
threading machine and a slotting machine. A box of wood screws requires 3 minutes on the
slotting machine and 2 minutes on the threading machine. A box of metal screws requires 2
minutes on the slotting machine and 8 minutes on the threading machine. In a week, each
machine is available for 60 hours. There is a profit of £10 per box on wood screws and £17 per box
on metal screws. Formulate this problem as a linear programming problem given that the objective
is to maximise profit.

Solution:
Let x be the number of boxes of wood screws and y be the number of boxes of metal screws
Slotting constraint is 3x + 2y ≤ 3600
Threading constraint is 2x + 8y ≤ 3600
Objective is to maximize profit P = 10x + 17y
Convert constraints to equalities to find corner points
From 3x + 2y = 3600 and 2x + 8y = 3600
Multiply first by 4
12x + 8y = 14400
Subtract second
12x + 8y - 2x - 8y = 14400 - 3600
10x = 10800
x = 1080
Substitute into 3x + 2y = 3600
3(1080) + 2y = 3600
3240 + 2y = 3600
2y = 360
y = 180
Now find x-intercepts and y-intercepts
For 3x + 2y = 3600
x = 1200 when y = 0
y = 1800 when x = 0
For 2x + 8y = 3600
x = 1800 when y = 0
y = 450 when x = 0
Feasible corner points are (0, 0), (0, 450), (1080, 180), (1200, 0)
Evaluate profit at each point
At (0, 0): P = 0
At (0, 450): P = 17(450) = 7650
At (1080, 180): P = 10(1080) + 17(180) = 10800 + 3060 = 13860
At (1200, 0): P = 10(1200) = 12000
Maximum profit is 13860 at (1080, 180)
Final answer is to produce 1080 boxes of wood screws and 180 boxes of metal screws for a maximum
profit of 13860 pounds

35
Q:6
A distribution firm has to transport 1200 packages using large vans which can take 200 packages
each and small vans which can take 80 packages each. The cost of running each large van is £40
and of each small van is £20. Not more than £300 is to be spent on the job. The number of large
vans must not exceed the number of small vans. Formulate this problem as a linear programming
problem given that the objective is to minimise costs.

Solution:
Let x be the number of large vans and y be the number of small vans
Package constraint is 200x + 80y ≥ 1200
Cost constraint is 40x + 20y ≤ 300
Van ratio constraint is x ≤ y
Objective is to minimize cost C = 40x + 20y
Convert constraints to equalities to find corner points
From 200x + 80y = 1200 and 40x + 20y = 300
Divide both equations by 20
10x + 4y = 60
2x + y = 15
Solve by elimination
Multiply second by 4
10x + 4y = 60
8x + 4y = 60
Subtract
2x = 0
x=0
Substitute into 2x + y = 15
y = 15
Now from 200x + 80y = 1200 and y = x
Substitute y
200x + 80x = 1200
280x = 1200
x = 4.29
y = 4.29

36
Now from 40x + 20y = 300 and y = x
Substitute y
40x + 20x = 300
60x = 300
x=5
y=5
Now evaluate cost C = 40x + 20y
At (0, 15): C = 300
At (4.29, 4.29): C = 40(4.29) + 20(4.29) = 257.4
At (5, 5): C = 40(5) + 20(5) = 300
Minimum cost is 257.4 at (4.29, 4.29)
Final answer is to use 4.29 large vans and 4.29 small vans for minimum cost of £257.40

Q:7
Ann and Margaret run a small business in which they work together making blouses and skirts.
Each blouse takes 1 hour of Ann's time together with 1 hour of Margaret's time. Each skirt involves
Ann for 1 hour and Margaret for half an hour. Ann has 7 hours available each day and Margaret has
5 hours each day. They could just make blouses or they could just make skirts or they could make
some of each. Their first thought was to make the same number of each. But they get £8 profit on
a blouse and only £6 on a skirt.
(a) Formulate the problem as a linear programming problem.
(b) Find three solutions which satisfy the constraints.

Solution:
Let
x = number of blouses
y = number of skirts
Ann’s time constraint:
x+y≤7
Margaret’s time constraint:
x + 0.5y ≤ 5

37
Profit:
Profit from a blouse = £8
Profit from a skirt = £6
Objective function: Maximize P = 8x + 6y
(a) Linear Programming Formulation:
Maximize P = 8x + 6y
Subject to:
x+y≤7
x + 0.5y ≤ 5
x≥0
y≥0
(b) Find three solutions that satisfy the constraints:
1. Let x = 2, y = 4
Check:
x+y=6≤7
x + 0.5y = 2 + 2 = 4 ≤ 5
Valid. Profit = 8(2) + 6(4) = 16 + 24 = 40
2. Let x = 3, y = 3
Check:
x+y=6≤7
x + 0.5y = 3 + 1.5 = 4.5 ≤ 5
Valid. Profit = 8(3) + 6(3) = 24 + 18 = 42
3. Let x = 4, y = 2
Check:
x+y=6≤7
x + 0.5y = 4 + 1 = 5 ≤ 5
Valid. Profit = 8(4) + 6(2) = 32 + 12 = 44

38