Scribd
Upload
34 views8 pages

Capacitated Facility Location Problem Supply

The document describes a capacitated facility location problem with the following details: - There are 3 facilities (A, B, C) with capacities of 500, 600, 450 units respectively and fixed costs of $5000 each. - There are 6 clients with demands totaling 1230 units and different cost per unit depending on the facility. - The optimization problem is to determine which facilities to open to minimize total costs while meeting all demands without exceeding capacities. - The initial solution opens all 3 facilities but does not assign any demands, staying within the capacities with a total cost of $20000.

Uploaded by

ztrinh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
34 views8 pages

Capacitated Facility Location Problem Supply

The document describes a capacitated facility location problem with the following details: - There are 3 facilities (A, B, C) with capacities of 500, 600, 450 units respectively and fixed costs of $5000 each. - There are 6 clients with demands totaling 1230 units and different cost per unit depending on the facility. - The optimization problem is to determine which facilities to open to minimize total costs while meeting all demands without exceeding capacities. - The initial solution opens all 3 facilities but does not assign any demands, staying within the capacities with a total cost of $20000.

Uploaded by

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

Capacitated Facility Location Problem

DATA supply A B C
capacity 500 600 450
fixed cost 5000 5000 5000
demand requested cost/unit
client 1 100 23 34 45
client 2 180 49 32 18
client 3 230 72 12 28
client 4 310 16 19 35
client 5 240 54 52 61
client 6 170 9 84 19
total 1230
VARIABLES
received opened 1.0 1.0 1.0
client 1 0.0% 0.00% 0.00% 0.00%
client 2 0.0% 0.00% 0.00% 0.00%
client 3 0.0% 0.00% 0.00% 0.00%
client 4 0.0% 0.00% 0.00% 0.00%
client 5 0.0% 0.00% 0.00% 0.00%
client 6 0.0% 0.00% 0.00% 0.00%
500 600 450

COSTS fixed costs 5000 5000 5000


transport costs 0 0 0
total 20000

color-code
Data Variables Calculated Violated
D
800 2350 total
5000

27
25
74
45
23
27

1.0 2350
0.00%
0.00%
0.00%
0.00%
0.00%
0.00%
800 quantity still available

5000
0
main

0 0
0 0
230
140 170
0 0
0

Page 3
main

0 100
180 0
0 0
0 0
0 240
60 0

Page 4
negative allowed

0 0
0 0
230
140 170
0 0
0

Page 5
negative allowed

-260 360
180 0
0 0
0 0
0 240
60 0

Page 6
Knapsack problem

Sites A B C D E F G H
Costs 1300 1400 500 600 750 1200 540 370
Supply 100 200 500 300 400 550 630 200

Demand 2000

Chosen 0 0 0 0 0 0 0 0
Total cost 0 Supplied 0
Cost/supply 13 7 1 2 1.875 2.181818 0.857143 1.85

color-code
Data Variables Calculated Violated
I J
250 440
250 180

0 0 (between 0 and 1)

1 2.444444

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy