You are on page 1of 12

OPTIMIZATION MODELS

INDIVIDUAL ASSIGNMENT - 1

Submi ed by

V. Sudarshan

FT241088

Sec - 1
Q3

Forecast
of
Product / machine
X Y
Machine use
time in
mins
A 50 24 2400
B 30 33 2100
Existing Stock 30 90
Demand
75 95
forecast

Let Xi be the number of units of products produced in the current week, where i = 1,2

Objec ve Func on
max (X1+30-75) + (X2+90-95)
S.t
50 X1 + 24 X2 ≤ 2400 (machine A me)
30 X1 + 33 X2 ≤ 2100 (machine B me)
X1 ≥ 75 – 30 i.e. X1 ≥ 45 (demand-stock)
X2 ≥ 95 – 90 i.e. X2 ≥ 5
X1 , X2 ≥0 (Non- nega vity)
Maximum occurs at the intersec on of x=45, y=5, and 50X1 + 24X2 = 2400 by solving the equa ons.

Op mal Solu on = 1.25


Q4

Let Xi be the number of units of bags produced where i=1;Standard & i=2;Delux

Objec ve func on
max 10X1 + 9X2

S.t
7/10 X1 + X2 ≤ 630
½ X1 + 5/6 X2 ≤ 600
X1 + 2/3 X2 ≤ 708
1/10 X1 + ¼ X2 ≤ 135
X1 , X 2 ≥ 0

Decision Variables X1 X2
Optimal Solution 514 252
Z
Objective Function Coefficeints 10 9 7411

Constraint Coeff 1 7 10 0 <= 6300 Cutting & Dyeing


Constraint Coeff 2 3 5 0 <= 3600 Sewing
Constraint Coeff 3 3 2 0 <= 2124 Finishing
Constraint Coeff 4 2 5 0 <= 2700 Inspection and Packaging

a) Standard – 514; Deluxe – 0


b) Profit = $5140

Q6

Let Xij be the output of the crops, where i = 1, 2 & 3 for Kibbutz 1, 2 & 3 respec vely and j = 1, 2 & 3
for sugar beets, co on and sorghum respec vely

Objec ve func on

max [ 1000(X11 + X21 + X31) + 750(X12 + X22 + X32) + 250(X13 + X23 + X33)

S.t

X11 + X12 + X13 ≤ 400 (usable land of kibbutz 1)

X21 + X22 + X23 ≤ 600 (usable land of kibbutz 2)

X31 + X32 + X33 ≤ 300 (usable land of kibbutz 3)

3X11 + 2X12 + X13 ≤ 600 (water alloca on for kibbutz 1)

3X21 + 2X22 + X23 ≤ 800 (water alloca on for kibbutz 2)


3X31 + 2X32 + X23 ≤ 375 (water alloca on for kibbutz 3)

X11 + X21 + X31 ≤ 600 (max quota for sugar beets)

X12 + X22 + X32 ≤ 500 (max quota for co on)

X13 + X23 + X33 ≤ 325 (max quota for sorghum)

Propor onality constraint:

(X11 + X12 + X13)/400 = (X21 + X22 + X23)/600 = (X31 + X32 + X33)/300

And Xij ≥ 0 for i=1,2,3 and j=1,2,3

Q10

Let Xi be the grams of ingredients per serving for the two food items where i= 1 for steak and 2 for
potatoes
Objec ve func on

min 4X1 + 2X2

S.t.
5X1 + 15X2 ≥ 50 (Carbohydrates)

20X1 + 5X2 ≥ 40 (Protein)

15X1 + 2X2 ≥ 60 (Fat)

X1 , X 2 ≥ 0

Decision Variables X1 X2
Optimal Solution 1.27 2.91
Z
Objective Function Coefficeints 4 2 10.91

Constraint Coeff 1 5 15 0.00 >= 50 Carbohydrates


Constraint Coeff 2 20 5 0.00 >= 40 Protein
Constraint Coeff 3 15 2 0.00 >= 60 Fat

Q16

Let Xij be the number of units of size j product (for j =1,2,3 for Large, Medium, and Small respec vely)
produced at plant i (i = 1, 2, 3).
Objec ve func on
max (420(X11 + X21 + X31) + 360(X12 + X22 + X32) + 300(X13 + X23 + X33))

S.t

Capacity constraints
X11 + X12 + X13 ≤ 750
X21 + X22 + X23 ≤ 900
X31 + X32 + X33 ≤ 450

Storage space constraints


20 X11 + 15 X12 + 12 X13 ≤ 13000
20 X21 + 15 X22 + 12 X23 ≤ 12000
20 X31 + 15 X32 + 12 X33 ≤ 5000

Forecast constraint
X11 + X21 + X31 ≤ 900
X12 + X22 + X32 ≤ 1200
X13 + X23 + X33 ≤ 750

Propor on constraints
(X11 + X12 + X13 )/750 - (X21 + X22 + X23 )/900 = 0
(X11 + X12 + X13 )/750 - (X31 + X32 + X33 )/450 = 0
(X21 + X22 + X23 )/900 - (X31 + X32 + X33 )/450 = 0

Xij ≥ 0 for all values of i & j

Q17

Let Xij be the units of electricity supplied for i requirement through j source; where i=1,2,3 for
electricity, water hea ng, and space hea ng respec vely and j=1,2,3 for electricity, natural gas and
solar hea ng

Objec ve func on

min 50X11 + 90X21 + 60X22 + 30X23 + 80X31 + 50X32 + 40X33

S.t.
X11 ≥ 20

X21 + X22 + X23 ≥ 10

X31 + X32 + X33 ≥ 30

X23 + X33 ≤ 30

Xij ≥ 0 for all values of i & j


Q20

Let Xij be the number of interviews to be conducted on households with or without children (i) and
during me of day j; where i=1,2 for children and no children case respec vely and j=1,2 for day and
evening respec vely.

Objec ve func on

Min 20X11 + 25X12 + 18X21 + 20X22

S.t
X11 + X12 + X21 + X22 = 1000

X11 + X12 ≥ 400

X21 + X22 ≥ 400

X12 + X22 ≥ X11 + X12

X12 ≥ 0.4(X12 + X11)

X22 ≥ 0.6(X21 + X22)

Xij ≥ 0 for i=1,2 and j=1,2

Q21

Let Xi be the amount in dollars to be invested in investment i; where i is 1,2,3,4,5 for Atlan c oil,
Pacific oil, Midwest steel, Huber steel, and Government bonds respec vely.

The objec ve func on being: maximize [0.073X1 + 0.103 X2 + 0.064X3 + 0.075X4 + 0.045X5]

Subject to:

X1 + X2 + X3 + X4 + X5 = 100000

X1 + X2 ≤ 50000

X3 + X4 ≤ 50000

X5 ≥ 0.25(X3 + X4)

X2 ≤ 0.6(X1 + X2) (or) 0.4X2 ≤ 0.6X1

Xi ≥ 0 for i=1,2,3,4,5

Problem 21

Decision Variables X1 X2 X3 X4 X5
Optimal Solution 20000 30000 0 40000 10000
Z
Objective Function Coefficeints0.073 0.103 0.06 0.075 0.045 8000

Constraint Coeff 1 1 1 1 1 1 100000 = 100000 Investment constraint


Constraint Coeff 2 1 1 0 0 0 50000 <= 50000 Statement 1
Constraint Coeff 3 0 0 1 1 0 40000 <= 50000 Statement 1
Constraint Coeff 4 0 0 0.25 0.25 1 10000 >= 10000 Statement 2
Constraint Coeff 5 0.6 0.4 0 0 0 12000 <= 12000 Statement 2
Op mal solu on is 8000

Q23 a

Shortest Path:

Nearest nth
Iteration Solved Total Minimum Arc
unsolved Nearest
ID (n) Node Distance Distance Added
Node Node
1 O A 4 A 4 OA
O C 5
2 B,C 5 OC,AB
A B 5
A D 11
3 B E 9 E 9 BE
C E 10
E D 10
4 A D 11 D 10 ED,BD
B D 10
D T 16
5 T 16 DT
E T 17

Shortest path – O-A-B-D-T

Distance – 16

Minimum Spanning Tree:

Routes Distance
BA 1
BC 2
AO 4
BE 4
DE 1
DT 6

Total 18
Case Study 1
Case Study 2

You might also like