0% found this document useful (0 votes)
62 views5 pages

OR Assignment 1 LP 16102022 083722pm

This document contains an example operations research assignment with 5 unsolved problems. The assignment involves maximizing profits or minimizing costs given various constraints. It provides data on machine capacities, part costs, sales prices, and time or quantity limits. The student is asked to determine the optimal production mix, time allocation, number of units, or cost-minimizing solution for each unsolved problem.

Uploaded by

Ambreen Ishaque
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
62 views5 pages

OR Assignment 1 LP 16102022 083722pm

This document contains an example operations research assignment with 5 unsolved problems. The assignment involves maximizing profits or minimizing costs given various constraints. It provides data on machine capacities, part costs, sales prices, and time or quantity limits. The student is asked to determine the optimal production mix, time allocation, number of units, or cost-minimizing solution for each unsolved problem.

Uploaded by

Ambreen Ishaque
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Bahria University (Karachi Campus)

Operations Research (BBA 6C & 6E) Assignment # 1

Assigned Date: 16/10/2022

Submission Date: Will be specified in the class (One week)

Example Question 1: A small plant makes two types of automobile parts. It buys castings that
are machined, bored, and polished. The data shown in Table 1 are given.

Part A Part B
Machine Capacity 25 per hour 40 per hour
Boring Capacity 28 per hour 35 per hour
Polishing Capacity 35 per hour 25 per hour

Castings for part A cost $2 each; for part B it cost $3 each. Parts are selling for $5 and $6, respectively.
The three machines have running costs of #20, $14, and $17.50 per hour. Assuming that any
combination of Parts A and B can be sold, what product mix maximizes profit?

Solution: The first step is to calculate the profit per part. This is done in Table2.

Part A Part B
Machining 20/25 = 0.8 20/40 = 0.5
Boring 14/28 = 0.5 14/35 = 0.4
Polishing 17.50/28 = 0.5 17.50 = 0.7
Purchase 2.00 3.00
Total Cost 3.80 4.60
Sales Price 5.00 6.00
Profit 1.20 1.40

From the results shown, if on the average x of Part A and y of Part B per hour is made, the net profit is

z=1.2 x+1.4 y

Because there is no meaning for negative x and y, x ≥ 0 , y ≥0.

X and y cannot be chosen freely, because the capacity limits have to be taken into account. These yield
the following results.

x y
Machining + ≤1
25 40

x y
Boring + ≤1
28 35
x y
Polishing + ≤1
35 25

Multiplying through to clear fractions and obtain:

Machining 40 x +25 y ≤1000

Boring 35 x+ 28 y ≤ 980

Polishing 25 x+ 35 y ≤ 875

The point (x,y) for which profits attain their maximum must lie at one of the corners of OABC. The
possible maximizing values are O(90,0), A(0,25), B(16.93,12.90), and C(25,0). The corresponding profits
are Z 0=0 , Z A =35 , Z B =38.39 ,∧Z C =30 , so that the best production plan is 16.93 of A per hour and
12.90 of B per hour to earn the best possible profit of Z=38.39.

Example Question2: Assume you want to decide between alternative ways of spending an
eight-hour day, that is, you want to allocate your resource time. Assume you find it five times more fun
to play ping pong in the lounge than to work, but you also feel that you should work at least three times
as many hours as you play ping pong. Now the decision problem is how many hours to play and how
many to work in order o maximize your objective: “Fun.”

Solution: Let X number of hours spent working, and Y number of hours spent playing.
You want to maximize your fun, F, where F=X +5 Y

Your total time per day is limited to eight hours: X +Y ≤ 8.

And, finally, you should work at least three times as long as you play: 3Y ≤ X.

You cannot spend a negative number of hours, hence X ≥ 0 , Y ≥ 0.

At point A(8,0) F=8. At point B(6,2) F=16. At point O(0,0) F=0. So that the objective has
assumed its maximum value at point B.

Unsolved Problem1:

Answer: Hotdogs=560 Sodas=280 Profit=$56.00

Unsolved Question 2:
Answer 2: Truck = 30 Automobiles = 15 per week. Maximum Profit= $12000.

Unsolved Problem 3:

Answer 3: Standard Units= 44 Delux Units= 16 Profit= $44.

Unsolved Problem 4:

Answer4: Two Combinations. Point A(0,15) Z=120 or Point B(2,14) Z=120.

Unsolved Question5:
Answer5: Janet = 3 days Sue = 2 days Minimum Cost = $116.

You might also like