0% found this document useful (0 votes)
5 views

Linear Programming

Uploaded by

Amine Benseddiq
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views

Linear Programming

Uploaded by

Amine Benseddiq
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 33

No of Radio Ads No of TV Ads

Variables 175 10 <- Dummy numbers


3000 7000 <- Coefficient
Objective (Max)
No of people reached 595000

Formula
Constraints Table: LHS
Budget : 200 500 40000
at least 10 radio 1 175
at least 10 TV 1 10
R >= TV 1 -1 165

Summary Sentence:
Purshase 175 Radio Ads, 10 TV ads, to reach a maximum of 595000 people.
Sign RHS
<= 40000 =SUMPRODUCT(B11:C11,$B$2:$C$2)
>= 10
>= 10
>= 0
Transportation Example
destinations
Data Table: Albany Boston Cleveland Output
Des Moine 5 4 3 100
sources Evanston 8 4 3 300
Ft lauderdale 9 7 5 300
Demand 300 200 200

destinations
Shipment Table Albany Boston Cleveland Output
sources

Des Moine 100 0 0 100


Evanston 0 200 100 300
Ft lauderdale 200 0 100 300
Demand 300 200 200

Objective (Min)
Total Cost: 3900 =SUMPRODUCT(C4:E6,C12:E14)

Summary Sentence: Ship 100 units from Des Moine


to Albany, 200 units from Evanston to Boston and
100 to Cleveland, 200 units from Ft Lauderdale to
Albany and 100 to Cleveland for a Minimum Total
Cost of 3900.
Transportation Problem - Alternative Template

Origin/Factories Destintation/stores Unit Cost Shipments


Des Moines Albany 5 100
Des Moines Boston 4 0
Des Moines Cleveland 3 0
Evanston Albany 8 0
Evanston Boston 4 200
Evanston Cleveland 3 100
Ft Lauderdale Albany 9 200
Ft Lauderdale Boston 7 0
Ft Lauderdale Cleveland 5 100

Supply Constraints
Factories Outflow Sign Capacity
Des Moines 100 <= 100
Evanston 300 <= 300
Ft Lauderdale 300 <= 300

Demand Constraints
Stores Inflow Sign Demand
Albany 300 >= 300
Boston 200 >= 200
Cleveland 200 >= 200

Objective Function Cost: 3900


Construction Projects

Data Table: Projects


Project A Project B Project C Capacity
Sources Plant 1 $ 10 $ 4 $ 9 80
Plant 2 $ 12 $ 6 $ 8 40
Plant 3 $ 8 $ 9 $ 5 30
Requirements 50 40 60

Shipments Table Projects


Project A Project B Project C Capacity
Sources

Plant 1 40 40 0 80
Plant 2 0 0 40 40
Plant 3 10 0 20 30
Requirements 50 40 60

Objective Function (Min)


Total Cost : 1060

Summary Sentence:Plant 1 should ship 40


truckloads to Project A and 40 To Project 40, Plant 2
should ship 40 truckloads to Project C, Plant 3
should ship 10 to Project A 10 and 20 to Project C.
Assignment Problem
New Hire

Cost Table Relocation Offices


Omaha Miami Dallas New York
Jones $ 800 $ 1,100 $ 1,200 $ 1,000
Candidates Smith $ 500 $ 1,600 $ 1,300 $ 800
Wilson $ 500 $ 1,000 $ 2,300 $ 1,500

Assignment Table Offices


Omaha Miami Dallas New York
Jones 0 1 0 0
Candidates Smith 0 0 0 1
Wilson 1 0 0 0
Total 1 1 0 1
<= <= <= <=
1 1 1 1

Objective (Min)
Relocation Cost $ 2,400.00
Summary Sentence: The company should sen
to Miami, Smith to New York and Wilson to Om
a Total Relocation Minimum Cost of 240
Total sign equal
1 = 1
1 = 1
1 = 1

ompany should send Jones


rk and Wilson to Omaha for
nimum Cost of 2400$.
MLB Umpire Assignment

Distance Games
Kansas City Chicago Detroit Toronto
Seattle 1500 1730 1940 2070
Arlington 460 810 1020 1270
cities Oakland 1500 1850 2080 X
Baltimore 960 610 400 330

Assignment Games
Kansas City Chicago Detroit Toronto Total sign
Seattle 0 0 1 0 1 =
Arlington 0 1 0 0 1 =
cities Oakland 1 0 0 0 1 =
Baltimore 0 0 0 1 1 =
Total 1 1 1 1
<= <= <= <=
1 1 1 1
Objective Function (Min)
Total Distance 4580 Summary Sentence: The Crew in Seattle should
be sent to Detroit, the one in Arlington to
Chicago, the one in Oakland to Kansas City and
the one in Baltimore should be sent to Toronto
for a Total Minimum Distance of 4580 Miles.
equal
1
1
1
1

in Seattle should
in Arlington to
o Kansas City and
e sent to Toronto
e of 4580 Miles.
Courses
Statistics Management Finace Economics
professors

Bain 80 85 95 40
Carey 85 30 75 65
Dio 90 55 80 70
Powell 55 80 65 50

Courses
Statistics Management Finace Economics Total
professors

Bain 0 0 1 0 1
Carey 1 0 0 0 1
Dio 0 0 0 1 1
Powell 0 1 0 0 1
Total 1 1 1 1
sign = = = =
Equal 1 1 1 1

Objective (Max)
Total Ratings 330
Summary Sentence: Professor Bain should take The
Finance Course, Carey to take the statistics, Dio to
take Economics and Powell to take Management for
an Overall Rating of 330.
Sign Equal
= 1
= 1
= 1
= 1

should take The


statistics, Dio to
Management for
30.
Maxie and Bianca own Umbrella Corporation

Data Table Store A Store B Store C output


Factory 1 $ 28 $ 20 $ 36 100
Factory 2 $ 22.25 $ 26.25 $ 30.25 120
Demand 80 60 70

Shipment Table Store A Store B Store C output Cost


Factory 1 30 60 0 90 6
Factory 2 50 0 70 120 6.25
Demand 80 60 70

Objective (Min)
Total Cost 5270
Summary Sentence: Factory 1 should send 30
jersies to Store A and 60 to Store B, Factory 2
should send 50 to Store A and 70 to Store C for
a Total Minimum Cost Of 5270$.
1 should send 30
tore B, Factory 2
d 70 to Store C for
Of 5270$.
Johns Hopkins Basketball jersey

TO Plants
A B C Transfer
Plant 1 5 8 6 60
From Plant 2 10 9 12 105
Plant 3 7 6 10 70
Open 45 90 35

TO Plants
A B C Transfer
Plant 1 0 60 0 60
From Plant 2 45 30 30 105
Plant 3 0 0 5 5
Open 45 90 35

objective (Max) Summary Sentence: maxie should send 60


Total product Output 1610 workers from plant 1 to plant B, from plant 2
send 45 to plant A, 30 to plant B, 30 to plant C,
and from plant 3 should send 5 to plant C for a
Maximum Product Output of 1610.
should send 60
t B, from plant 2
t B, 30 to plant C,
5 to plant C for a
ut of 1610.
Nike Factory
No of Basketballs No of Soccer balls
variables 12 4
profit 10 20
Objective (Max) : 20x+10y 200

Constraints; LHS
no more than 42 machine hours 3 1.5 42
24 of workers hours 1 3 24
Sign RHS
<= 42
<= 24
Princess Brides Example : Integer Programming

Variables Peak Off Peak


4 1
8200 5100

Objective (Max)
People Reached 37900

Constraints LHS Sign RHS


Budget $ 390 $ 240 1800 <= $ 1,800
no more 6 off peak 1 1 <= 6
At least 2 peak 1 4 >= 2

Summary Sentence: They should do 4 Peak Ads


and 1 Off Peak Ads for a Maximum People
reached of 37900.
Bolsa de Cafe

Variables No of 20lb Bags lbs of grinderd Beans


44 20.00
$ 85.00 $ 1.50

Objective (max)
Profit 3770

Constraints: LHS Sign


A 30 0.5 1330 ≤
B 18 0.4 800 ≤
C 2 0.1 90 ≤

Summary Sentence: We Recommend producing 44 of 20lb Bags


and 20 lbs of grinded Beans for a Maximum Profit of 3770$.
RHS
2000
800
200

44 of 20lb Bags
rofit of 3770$.
Hila Hernandez

No of large posters No of small posters


2 6

Objective (Max) 52
profit 5 7

Constraints LHS
4 Max large can be sold 1 2
up to 6 of small can be sold 1 6
max 15 hours a week 3 1.5 15

Summary Sentence: We Recommend Making 2 large posters


small poster for a maximum profit of 52$.
SIGN RHS
<= 4
<= 6
<= 15

king 2 large posters and 6


profit of 52$.
Binary : Invetment Decision

Variables: X1 X2 X3 X4 X5 X6 X7
(0,1) 0 0 1 1 1 1 0
50 80 90 120 110 40 45 (000s)

Objective(max)
Return 360 (000s)

Constraints LHS
at least 2 texas oil 1 1 1 2
no more 1 foreign 1 1 1
CA 1 1 1
Budget 480 540 680 1000 700 510 900 2890

Summary Sentence: We
Recommend Investing in Dutch
sell, Houston Drilling, Texas
Petroleum, San diego Oil for
Maximum Return 360000$.
Sign RHS
>= 2
<= 1
= 1
<= 3000
Horizon Wireless

Variables L1 L2 L3 L4 L5 L6
(0,1) 1 1 1 0 0 0

Objective (Min) 3

Constraints LHS Sign


Area A 1 1 1 >=
Area B 1 1 2 >=
Area C 1 1 2 >=
Area D 1 1 1 1 2 >=
Area E 1 1 1 >=
Area F 1 1 1 1 >=
Area G 1 1 1 >=
Area H 1 1 1 1 >=

Summary Sentence: We
Recommend Builiding 3 towers in L1
L2 and L3.
RHS
1
1
1
1
1
1
1
1

You might also like