Scribd
Upload
112 views

Find The Optimal Solution To The Linear Programming Model With He Integer Restrictions Relaxed

The document presents a linear programming problem to maximize total daily usage of projects by allocating resources while satisfying constraints on cost, space, and contingency. It evaluates 4 projects - swimming pool, tennis center, athletic field, and gymnasium - and selects the swimming pool and athletic field to achieve a total daily usage of 700. The optimal solution selects 1 swimming pool and 1 athletic field.

Uploaded by

Cher Na
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
112 views

Find The Optimal Solution To The Linear Programming Model With He Integer Restrictions Relaxed

The document presents a linear programming problem to maximize total daily usage of projects by allocating resources while satisfying constraints on cost, space, and contingency. It evaluates 4 projects - swimming pool, tennis center, athletic field, and gymnasium - and selects the swimming pool and athletic field to achieve a total daily usage of 700. The optimal solution selects 1 swimming pool and 1 athletic field.

Uploaded by

Cher Na
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 10

y≤5 maximize Z = 100X + 150Y

Subject to
8,000X + 4,000Y ≤ 40,000
15X + 30Y ≤ 200
X, Y ≥ 0 and integer
(0,10)
8000x + 4000y = 40,000
y x = number of presses
(0, 6.67) y = number of lathes
(2.22, 5.56)

15x + 30y = 200 8,000X + 4000Y = 40,000


if x = 0
0 + 4000Y = 40,000
Y = 10
(5,0) (13.33,0) (0, 10)
x

15x + 30Y = 200


if x = 0
15(0) + 30Y = 200
8000x + 4000y = 40,000 y = 6.67
15x + 30y = 200 (0,6.67)

8000x + 4000y = 40,000


4000y = 40000 - 8000x (0, 6.67)
y = 10 - 2x (2.22, 5.56)
(5,0)
15x + 30(10-2x) = 200 8000x + 4000y = 40000
15x + 300 - 60x = 200 8000 (2.22) + 4000y = 40,000 Z = 100(0) + 150(6.67)
-45x = -100 17760 + 4000y = 40000 Z = 1000.50
x = 2.22 4000y = 22240
y = 5.56 Z = 100(2.22) + 150(5.56)
Z = 222 + 834
Z = 1056

Z = 100(5) + 150(0)
Z = 500

(2,5)
Z = 100(2) + 150(5)
Z = 950

1.Find the optimal solution to the linear programming model with h


2.At node 1, let the relaxed solution be the upper bound and the ro
3.Select the variable with the greatest fractional part of the branchi
4.Create two new nodes, one for the ≤ constrain and one for the
5.Solve the relaxed linear programming model with the new constr
6.The relaxed solution is the upper bound at each node, and the e
7.If the process produces a feasible integer solution with the greate
Return to step 3
UB - x = 2.22, y = 5.56 (1,056)
LB - x = 2, y = 5 (950)

1,000 UB - x = 1.33, y = 6 (1033)


UB x - 2.5, y = 5 (1,000) y ≤5 y ≥6 LB x - 2, y = 5 (950)
LB x - 2, y = 5 (950)

x ≤1 x ≥2

UB - x = 1 y = 6.17 (1025.50)
LB - x = 1, y = 6 (1000)

1000
y ≤6 y ≥7
UB x = 1, y = 6 (1000)
LB - x = 1, y = 6 (1000)

x=1y=6
(1,6)
You should purchase 1 press and 6 lathes.
maximize Z = 100X + 150Y
(0,6)
8,000X + 4,000Y ≤ 40,000 (1,6) 1000
15X + 30Y ≤ 200 (2,5)
X, Y ≥ 0 and integer (3,4)
(3,3)
(4,2)
x = number of presses (4,1)
y = number of lathes (5,0)

y≤5
8,000X + 4000Y = 40,000 (0,5) 750
if y=0 (2.5,5) 1000
0 + 4000Y = 40,000 8000X + 4000(0) = 40000 (5,0) 500
X=5
(5,0) y≥6
(0,6) 900
(0,6.67) 1000.5
15x + 30Y = 200 (1.33, 6) 1033
if y = 0
15(0) + 30Y = 200 15x + 30(0) = 200
x = 13.33 x≤1
(13.33,0) (0,6.67) 1000.5
(1, 6) 1000
(0,6) 900
(1,6.17) 1025.5
(2.22, 5.56)

Z = 100(0) + 150(6.67)
Z = 1000.50

Z = 100(2.22) + 150(5.56)
Z = 222 + 834

Z = 100(5) + 150(0)

Z = 100(2) + 150(5)

ng model with he integer restrictions relaxed.


bound and the rounded-down integer solution be the lower bound.
art of the branching. Create two new constraints for this variable reflecting the parti
nd one for the ≥ constraint.
h the new constraint added at each of these nodes.
node, and the existing maximum integer solution (at any node) is the lower bound.
n with the greatest upper bound value of any ending node, the optimal integer solu
1,056

.33, y = 6 (1033)

1025.5
reflecting the partitioned integer values. The result will be a new ≤ and a new

s the lower bound.


ptimal integer solution has been reached. If a feasible integer solution does not em

1033

not
feasible

Not
feasible
≤ and a new ≥ constraint.

olution does not emerge, branch from the node with he greatest upper bound.

not
feasible
upper bound.
Projects Swimming Tennis CenAthletic FieGymnasium
Daily usage 300 90 400 150
Resource Constraints: Usage Constraint Available Left Over
Cost 35000 10000 25000 90000 60000 <= 120000 60000
Space 4 2 7 3 11 <= 12 1
Contingency 1 1 1 <= 1 0

Projects selected
Swimming pool 1W
Tennis center 0X maximize Z = 300W + 90X + 400Y + 150Z
Athletic field 1Y Constraints:
Gymnasium 0Z 35000W + 10000X + 25000Y + 90000Z ≤ 120,000
Total daily usage 700 4W + 2X + 7Y + 3Z ≤ 12
W+X≤1
W + X + Y + Z = 0 or 1
+ 90X + 400Y + 150Z

25000Y + 90000Z ≤ 120,000


Projects Condominium Land Bonds
Profit 9000 1500 1000
Resource Constraints: Invested Constraint Budget Left Over
Cost 50000 12000 8000 250000 <= 250000 0

Projects selected
Condominium 4
Land 0.1666666667
Bonds 6
Total profit 42250

You might also like