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

Optimization and Decision Making Assignment 1

Uploaded by

sareeba21
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views

Optimization and Decision Making Assignment 1

Uploaded by

sareeba21
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Optimization & Decision Making

Assignment 1
Syeda Areeba
U23200046
Exercise 1:
a) Variables:
2D = Distance being two-way trip
G = Amount of gasoline
P = Price of Gasoline

Objective Function:
Derive total cost and minimize the cost of gasoline in trip

Constraint:
Total Gasoline cost = (2D/G) *P

b) There is no variability or uncertainty in a deterministic model as we have two


assumptions:
a. The assumption is that the distance is determined or fixed can’t be vary or
changed.
b. The cost of the gasoline is also fixed so is the gasoline per mile being fixed

c) Yes, the deterministic model is acceptable for planning the fuel cost for a round as it
gives us a quick estimate of fuel costs being the trip is short and driving conditions are
consistent. But distances might change, and gasoline prices fluctuate, and
uncertainties may happen in real scenarios which can affect the model.
Exercise 2:
A) Decision variable: x and y are the number of units being produced.

- Objective function:
x with a profit of $10 per unit, the objective function is 10x.
y with a profit of $5 per unit, the objective function is 5x.
- Constraints: since it takes 2 hours to produce each unit, and 40 hours are available per
week, the production capacity constraint: 5x1+2x2 ≤ 40.

- The mathematical model for production problem is:


Maximize: 10x+5y (objective function)
subject to: 5x1+2y ≤ 40 (production constraint)
x and y ≥ 0
B) Controllable Variables: Product Quantity of x1 and x2
Uncontrollable variables:
a) x = $ 10 (Unit Profit for product 1)
b) y = $ 5 (Unit Profit for product 1)
c) x = 5 hours (Production Time per unit)
d) y = 2 hours (Production Time per unit
e) 40 hours per week (Production capacity)

Uncontrollable inputs
$10 is the profit per unit of x
C)
$5 is the profit per unit of y
5 hours production time per unit x
2 hours production time per unit y
40 hours of production capacity

Contro Mathematic Output


llable al Model Profit
inputs Maximize: =
10x
D) If X = 0
Then 5x+2y ≤ 40
Y ≤ 40 /20 = 20
5 * 20 = 100

If Y = 0
Then 5x+2y ≤ 40
X ≤ 40/5 = 8
8 * 10 = 80

The optimal solution point is at (100,80)

E) The model developed is deterministic as the model assume that all parameters and
inputs have fixed with known values.
Exercise 3:
a. The model: 9600 + 2(120) = 9600 + 240x
b. The model is: 600x – 240x -9600 = 360x - 9600
c. Substituting 30 in 360(30) - 9600 = $1,200
d. 360x – 9600 = 0, X = 9600/360 =26.666
Exercise 4:
Maximum 5A + 5B=z
Subjected to:
1A =100
1B= 80
2A + 4B =400
A, B = 0
2A + 4B = 400
Where A = 0 and B = 100
Or A = 200 and B = 0
5A + 5B = 80
Where A = 0 and B = 16
Or A = 16 and B = 0
The optimal solution (100,50)
Exercise 5:
a) Maximum 10 S + 18D
Subject to:
1. Cutting and Dyeing: 7/10 S + 1D ≤ 630
2. Sewing: 1/2 S + 5/6D ≤ 600
3. Finishing: 1S + 2/3D ≤ 708
4. Inspection & packaging: 1/10 S + ¼ D ≤ 135
S, D ≥ 0

Maximum 10 S + 9D
Subject to:
1. Cutting and Dyeing: 7/10 S + 1D = 630
2. Sewing: 1/2 S + 5/6D = 600
3. Finishing: 1S + 2/3D = 708
4. Inspection & packaging: 1/10 S + ¼ D = 135
S, D = 0
Optimal Solution derived is: (540, 525)
Substituting values:
10(540) + 9(525) = $ 10,125

b) Maximum 20 S + 9D
Subject to:
1. Cutting and Dyeing: 7/10 S + 1D = 630
2. Sewing: 1/2 S + 5/6D = 600
3. Finishing: 1S + 2/3D = 708
4. Inspection & packaging: 1/10 S + ¼ D = 135
S, D = 0

Optimal Solution derived is: (540, 525)


Substituting values:
20(540) + 9(525) = $ 15,525

c) Using the optimal solution from (b)


(540) + 9(525) = $ 5265
Exercise 6:
a) Maximum 3A + 4B
Subject to:
-1A + 2B ≤ 8
1A + 2B ≤ 12
2A +1B ≤ 16
A=0
B=0
b) Given equation:
2(1A+2B ≤ 12) = 2A +4B ≤ 24.

(2A +4B ≤ 24) – (2A + 1B ≤ 16)

3B = 8

B = 2.67

Substituting B

2A + 2.67 =16

A = 6.67

Optimal Solution (6.67, 2.667)

c) Including the Slack Variables s1, s2 and s3


Equations are:
-1A + 2B+ s1 = 8
1A + 2B + s2 =12
2A +1B + s3= 16
-3A – 4B + Z = 0

Substituting A = 6.6 and B = 2.6 from (b)


-1A + 2 B + s1 = 8

-1(6.6) + 2(2.6) + s1 = 8
-6.6 + 5.2 + s1 = 8
−1.4+s1=8
s1=9.4

1 (6.6) +2(2.6) +s2=12


6.6+5.2+S2=12
11.8+s2=12
s2=0.2

2(6.6) +1(2.6) +s3=16


13.2+2.6+s3=16
15.8+s3=16
s3=0.2

The slack variables at the optimal solution (6.6, 2.6) are:


s1=9.4
s2=0.2
s3=0.2

At the optimal solution (6.6, 2.6) s1 is greater than zero showing there is some slack
or surplus as the first constraint is not fully binding.

2. s2 and s3 being almost zero show that there is no slack in the constraints and the
second and third constraints are binding at the optimal solution.

You might also like