Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
24 views7 pages

Solutions

This document presents a linear programming optimization problem to maximize total profit by determining the optimal quantities of four products (O, C, S, T) given constraints on available resources. The optimal solution is to produce 175 bicycles of type S, yielding maximum profit of $6850.

Uploaded by

Minza Jahangir
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)
24 views7 pages

Solutions

This document presents a linear programming optimization problem to maximize total profit by determining the optimal quantities of four products (O, C, S, T) given constraints on available resources. The optimal solution is to produce 175 bicycles of type S, yielding maximum profit of $6850.

Uploaded by

Minza Jahangir
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/ 7

Maximize Z = 30*O + 25*C + 22*S + 20*T

Subject to,
2*O + 2*C + 1*S + 1*T <= 500
5*O + 6*C + 4*S + 4*T <= 1200
1*O + 1*C + 1*S + 1*T >= 275
O, C, S, T >= 0

Answer (3):
The Optimal Solution is as follows: and
Number of Sea Sprite bicycles ordered = 175 bicycles
And,
Maximum profit = $6850

4. The assembly hours constraint's range of viability is [1100, 1325].


The dual price is valid within the range of 1100 to 1325 for the assembly hours limitation.

5.
The amended space is 600 (=500+100), which is within the range of practicable [375,] and will
therefore be charged at twice the price if the store had an additional 100 feet of storage space.
The optimal solution and the largest profit, however, won't change because the dual cost of the
space constraint in this instance is 0.
6. According to the sensitivity analysis, the constraint for the quantity of bicycles to be ordered
has the largest negative dual price. Therefore, the business should focus on the resource "number
of bikes to be ordered" rather than inventory space or assembly time.

7. When the store needs 5 extra bikes in stock, the modified resource for the number of bicycles
ordered is 280 (=275+5), which is within the optimality range [240, 300], thus the dual pricing
will be applied.
Therefor, maximum Profit after changing the objective function is $6800.

8.
When the profit for those bicycles increases to 35, the value is within the Cityscape bicycles'
optimality range, making it the best option.

9. The reduced cost for the Trail Blazer bicycles is -$2 per unit

10. Since the value is still within the Trail Blazer bicycles' range of optimality when the profit
increases to 22, the optimal solution remains the same.

a. MAX: Z = ( 6 * X ) + ( 8 * Y )
(4X ) + ( 5Y ) <= 10000
(5X ) + ( 2Y ) <= 5000
X >= 500
Y >= 0
b.

c. Corner points ( 500 , 1250 ) , ( 500 , 0 ) and ( 1000 , 0)


d. Optimal Solution: 500 bunches of roses and 1250 bunches of carnations
Optimal solution is 13000 profit
A. Let A = pounds of Type A seed in the blend
B. Min A + 2B
C.
d.The optimal solution is at A = 250, B = 50.
e. Constraint 2 has a surplus value of 150.
f. The cost is 350

Excel file : Q4a


For season 1 of 5, S1t = 1, S2t = 0, and t = (3 * 4) + 1 = 13

The forecast is = 797 + 1095.433 + 0 + (36.467 * 13) = 2366 for year 5 season 1. (Ans).

3.2. For year 5, season 2, S1t = 0 and S2t = 1, the equation is: t = (3 * 4) + 2 = 14.
The forecast is = 797 + 0 + 1189.467 + (36.467 * 14) = 2497 for year 5 season 2. (Ans).

3.3. For season three of year five, S1t = 0, S2t = 0, and t = (3 * 4) + 3 = 15

For year 5 season 3, the forecast is = 797 + 0 + 0 + (36.467 * 15) = 1344. (Ans).

You might also like