1

BAB 2
PEMROGRAMAN LINIER
(LINEAR PROGRAMMING)
 INTRODUCTION 2

• Keputusan manajemen yang baik harus diambil secara efektif

berdasarkan ketersediaan sumberdaya organisasi yang terbatas.
• Sumberdaya dapat berupa: mesin, peralatan, bahan baku, uang, waktu,
tempat, material, dan lain sebagainya.
• Sumberdaya pada umumnya digunakan untuk proses produksi (mesin,
bahan baku, biaya, staf, dsb.) maupun pelayanan/service (penjadwalan,
periklanan, investasi, pengiriman, dsb.).
• Pemrograman Linier (PL) atau Linear programming (LP) merupakan
teknik pemodelan matematika yang dapat digunakan untuk membantu
manager dalam melakukan perencanaan dan pengambilan keputusan
berkaitan dengan alokasi sumberdaya.
• Terlepas dari istilahnya, linear programming, dan teknik-tekik yang
dikategorikan ke dalam “mathematical programming”, tidak berkaitan
langsung dengan pemrograman computer pada umumnya.
• Di Riset Operasi, istilah “programming” hanya merujuk pada pemodelan
dan pengambilan keputusan secara matematis, selanjutnya disebut
dengan plan atau perencanaan.
• Namun demikian, pemrograman computer memainkan peranan penting
dalam pengembangan dan penggunaan PL untuk menyelesaikan
masalah-masalah nyata dari PL dalam kehidupan sehari-hari.
 Model Pemrograman Linier (PL) 3

Sebagian besar model RO (deterministik) dapat diformulasikan

sebagai program-program matematis.

Istilah "Program" dalam konteks ini dapat ditafsirkan sebagai “plan”

(rencana), bukan program komputer.

Model Umum Program Linier:

Mak./Min. z = f(x1, x2 ,…, xn)

Batasan gi(x1, x2 , …, xn)

{}£
³
=
bi i =1,…,m

xj ≥ 0, j = 1,…,n
 Komponen Model PL 4

• xj disebut variable keputusan. Variabel yang

harus ditemukan dan dikontrol.

• gi(x1, x2 ,…, xn)

{}


=
bi disebut sebagai struktur

(atau fungsi) batasan

• xj ≥ 0 adalah batasan non-negatif

• f(x1, x2 ,…, xn) adalah fungsi obyektif atau

tujuan
 EXAMPLE: GIAPETTO WOODCARVING INC.,
5

• Giapetto Woodcarving, Inc., adalah perusahaan manufaktur yang memproduksi 2

tipe mainan kayu (wooden toys): tentara dan kereta.

• Satu mainan tentara dijual seharga $27 dan memerlukan $10 untuk material. Setiap
mainan tentara memerlukan biaya tenaga kerja dan biaya produksi sebesar $14.

• Satu mainan kereta dijual seharga $21 dan memerlukan $9 untuk material. Setiap
kereta memerlukan biaya tenaga kerja dan biaya produksi sebesar $10.

• Perusahaan memerlukan 2 tipe keahlian dari tenaga kerja, carpentry dan finishing.
Satu mainan tentara memerlukan 1 jam untuk carpentry dan 2 jam untuk finishing.
Satu mainan kereta memerlukan 1 jam carpentry dan 1 jam finishing.

• Tiap minggu, perusahaan hanya memiliki waktu kerja 80 jam untuk carpentry dan
100 jam untuk finishing.

• Permintaan pasar dari mainan kereta dalam setiap minggu jumlahnya tak terbatas,
namun mainan tentara hanya memiliki permintaan pasar sebesar 40 mainan tiap
minggu.

• Perusahaan berusaha untuk memaksimalkan keuntungan setiap minggunya.

• Formulasikan permasalahan tersebut dengan menggunakan model Program Linier

untuk memaksimalkan keuntungan dengan keterbatasan sumber daya yang
dimilikinya.
 SOLUTION: GIAPETTO WOODCARVING INC.,
6

Langkah 1: Formulasi Model

1. Variabel Keputusan:
Pada model PL, variable keputusan harus
dideskripsikan secara lengkap dan jelas yang
merepresentasikan keputusan yang akan
dibuat.
Pada contoh di atas, perusahaan harus
memutuskan: berapa jumlah mainan tentara
dan kereta yang harus dibuat tiap minggu.
Secara matematis, bisa didefinisikan
sebagai:
X1 = jumlah mainan tentara yang dibuat per minggu
X2 = jumlah mainan kereta yang harus dibuat per minggu
 SOLUTION: GIAPETTO WOODCARVING INC.,
7

2. Fungsi Obyektif:
Pada model PL, pengambil keputusan pada
umumnya berusaha untuk memaksimalkan
keuntungan (revenue atau profit) atau
meminimalkan biaya (cost) sebagai fungsi dari
variable keputusan.
Fungsi yang harus dimaksimalkan atau
diminimalkan disebut fungsi obyektif atau fungsi
tujuan.
Pada contoh ini, perusahaan akan memaksimalkan
keuntungan bersih (net profit) per minggu, yang
dapat didefinisikan sebagai:
Hasil Penjualan (Revenue) – Biaya Material – Biaya
Tenaga Kerja dan Biaya Produksi
 SOLUTION: GIAPETTO WOODCARVING INC.,
8

• Revenue = Revenue Tentara + Revenue Kereta

= 27 X1 + 21 X2
• Biaya Material = 10 X1 + 9 X2
• Biaya Tenaga Kerja dan Produksi = 14 X1 + 10 X2
Artinya perusahaan harus memaksimalkan:
(27 X1 + 21 X2) – (10 X1 + 9 X2) – (14 X1 + 10 X2)
= 3 X1 + 2 X2

Sehingga, fungsi obyektif-nya adalah:

Maks Z = 3 X1 + 2 X2
 SOLUTION: GIAPETTO WOODCARVING INC.,
9

3. Batasan:
Logikanya, fungsi obyektif (keuntungan maksimal)
akan diperoleh perusahaan jika nilai X1 dan X2
semakin besar. Artinya perusahaan akan
berusaha (jika dimungkinkan) memproduksi X1
dan X2 sebanyak-banyaknya.
Namun sayangnya, X1 dan X2 hanya dapat
diproduksi secara terbatas karena beberapa
keterbatasan (biasa disebut sebaga constraints):
Batasan 1: setiap minggu, waktu yang tersedia
untuk carpentry tidak lebih dari 80 jam.
Batasan 2: setiap minggu, waktu yang tersedia
untuk finishing tidak lebih dari 100 jam.
Batasan 3: setiap minggu, permintaan mainan
tentara tidak lebih dari 40 buah.
 SOLUTION: GIAPETTO WOODCARVING INC.,
10

• Jadi kita dapat merumuskan 3 batasan dalam

contoh ini, dan dapat dikaitkan dengan variable
keputusan X1 dan X2 sebagai berikut:
Batasan 1: 2 X1 + X2  100
Batasan 2: X1 + X2  80
Batasan 3: X1  40
 SOLUTION: GIAPETTO WOODCARVING 11INC.,
• Batasan Tanda:
Untuk melengkapi formulasi model PL, pertanyaan2 berikut
harus dapat dijawab dan berlaku untuk setiap variable
keputusan: Apakah variable keputusan dapat (diijinkan)
bernilai positif? negatif? atau negatif dan positif?
Jika variabel keputusan Xi hanya bernilai non-negatif (positif
atau nol) maka harus ditambahkan batasan tanda Xi  0.
Jika variable keputusan Xi dapat bernilai positif dan negatif
maka harus ditambahkan batasan tanda Xi = ~.
(Batasan tanda negatif pada umumnya jarang ditemukan
pada masalah-masalah PL).

Pada contoh ini, dua variable keputusan X1 dan X2 memiliki

batasan tanda non-negatif, atau X1  0 dan X2  0.
Jumlah produksi mainan tentara atau kereta bernilai non-
negatif. Artinya, masing-masing mainan dapat (dijinkan)
untuk tidak diproduksi (nol) atau diproduksi dalam jumlah
tertentu (positif)
 SOLUTION: GIAPETTO WOODCARVING INC.,
12

• Gabungan dari batasan tanda non-negatif dengan fungsi

obyektif dan batasan akan menghasilkan model optimasi
(biasanya disebut dengan model PL) sebagai berikut:

Max Z = 3 X1 + 2 X2 (Fungsi Obyektif)

Dengan Batasan:
2 X1 + X2  100 (batasan finishing)
X1 + X2  80 (batasan carpentry)
X1  40 (batasan permintaan mainan tentara)
X1  0 dan X2  0 (batasan non-negatif)

Solusi optimal dari model PL di atas adalah:

X1 = 20, dan X2 = 60, dengan Z = 180
(Perusahaan harus memproduksi mainan tentara sebanyak 20
buah, dan mainan kereta sebanyak 60 buah dengan
keuntungan bersih total sebesar $180).
SOLUTION: GIAPETTO WOODCARVING INC.,
13

Problem

Model PL

Solusi
 14
WHAT IS LINEAR PROGRAMMING PROBLEM (LP)?

Program Linier (PL) adalah masalah optimasi yang

memiliki ciri-ciri sebagai berikut:
1. Berusaha memaksimalkan (atau meminimalkan) fungsi
linier (yaitu fungsi tujuan) dari variable keputusan.
2. Nilai variable keputusan harus memenuhi semua
batasan yang telah diketahui (didefinisikan). Setiap
batasan harus berupa persamaan atau
pertidaksamaan linier.
3. Batasan tanda harus didefinisikan untuk setiap
variable keputusan. Setiap variable keputusan Xi,
batasan tanda Xi harus non-negatif (Xi > 0) atau Xi tak
terhingga, dan tidak ada batasan negatif.
 APPLICATIONS OF LP
15

1. Product mix problem

2. Diet problem
3. Blending problem
4. Media selection problem
5. Assignment problem
6. Transportation problem
7. Portfolio selection problem
8. Work-scheduling problem
9. Production scheduling problem
10. Inventory Problem
11. Multi period financial problem
12. Capital budgeting problem
 1. PRODUCT MIX PROBLEM 16

Example
Formulate a linear programming model for this
problem, to determine how many containers of
each product to produce tomorrow in order to
maximize the profits. The company makes four types
of juice using orange, grapefruit, and pineapple.
The following table shows the price and cost per
quart of juice (one container of juice) as well as the
number of kilograms of fruits required to produce
one quart of juice.

Product Price/quart Cost/quart Fruit needed

Orange juice 3 1 1 Kg.
Grapefruit juice 2 0.5 2 Kg.
Pineapple juice 2.5 1.5 1.25 Kg.
All –in - one 4 2 0.25 Kg each
 Product Mix Problem 17

EXAMPLE (CONT.)
ON HAND THERE ARE 400 KG OF ORANGE, 300 KG. OF
GRAPEFRUIT, AND 200 KG. OF PINEAPPLES.
THE MANAGER WANTS GRAPEFRUIT JUICE TO BE USED
FOR NO MORE THAN 30 PERCENT OF THE NUMBER OF
CONTAINERS PRODUCED. HE WANTS THE RATIO OF
THE NUMBER OF CONTAINERS OF ORANGE JUICE TO
THE NUMBER OF CONTAINERS OF PINEAPPLES JUICE
TO BE AT LEAST 7 TO 5. PINEAPPLES JUICE SHOULD
NOT EXCEED ONE-THIRD OF THE TOTAL PRODUCT.
 PRODUCT MIX PROBLEM 18
Solution
Decision variables
X1 = # of containers of orange juice
X2 = # of containers of grapefruit juice
X3 = # of containers of pineapple juice
X4 = # of containers of All-in-one juice
Objective function
Max Z = 2 X1 + 1.5 X2 + 1 X3 + 2 X3
Constraints

X 1  0.25 X 4  400 Orange constraints

2 X 2  0.25 X 4  300 Grapefruit constraint
1.25 X 3  0.25 X 4  200 Pineapple constraints
X 2  0.3( X 1  X 2  X 3  X 4) Max. of grapefruit
X1 7

X3 5 Ratio of orange to pineapple
1 Max. of pineapple
X 2  ( X 1  X 2  X 3  X 4)
3
X 1, X 2, X 3, X 4  0
Non-negativity constraints
 2. DIET PROBLEM
19

Example
My diet requires that all the food I eat come from one of
the four “basic food groups” (chocolate cake, ice
cream, soda, and cheesecake). At present, the
following four foods are available for consumption:
brownies, chocolate ice cream, cola, and pineapple
cheesecake. Each brownie costs 50 cents, each scoop
of chocolate ice cream costs 20 cents, each bottle of
cola costs 30 cents, and each piece of pineapple
cheesecake costs 80 cents. Each day, I must ingest at
least 500 calories, 6 oz of chocolate, 10 oz of sugar,
and 8 oz of fat. The nutritional content per unit of each
food is shown in the following table. Formulate a linear
programming model that can be used to satisfy my
daily nutritional requirements at minimum costs.
 20

DIET PROBLEM
Calories Chocolate Sugar Fat

Brownie 400 3 ounce 2 ounce 2 ounce

Chocolate ice cream 200 2 2 4

(1 scoop)
Cola (1 bottle) 150 0 4 1

Pineapple cheesecake 500 0 4 5

(1piece)
 DIET PROBLEM 21

Solution
• Decision variables: as always, we begin by
determining the decisions that must be made
by the decision maker: how much of each food
type should be eaten daily. Thus, we define the
decision variables:
X1 = number of brownies eaten daily
X2 = number of scoops of chocolate ice cream
eaten daily
X3 = number of bottles of cola drunk daily
X4 = number of pieces of pineapple cheesecake
eaten daily
 DIET PROBLEM 22

• Objective function: my objective function is to minimize the

cost of my diet. The total cost of my diet may be determined
from the following relation:
Total cost of diet = (cost of brownies) + (cost of ice cream) +
(cost of cola) + (cost of cheesecake)
Thus, the objective function is:
Min Z = 50 X1 + 20 X2 + 30 X3 + 80 X4
 DIET PROBLEM 23

• Constraints: the decision variables must satisfy the

following four constraints:
Constraint 1: daily calorie intake must be at least 500
calories.
Constraint 2: daily chocolate intake must be at least 6 oz.
Constraint 3: daily sugar intake must be at least 10 oz.
Constraint 4: daily fat intake must be at least 8 oz.
To express constraint 1 in terms of the decision variables,
note that (daily calorie intake) = (calorie in brownies) +
(calories in chocolate ice cream) + (calories in cola) +
(calories in pineapple cheesecake)
Therefore,
the daily calorie intake = 400 X1 + 200 X2 + 150 X3 + 500 X4
must be greater than 500 ounces
By the same way the other three constraints can be
formulated.
 DIET PROBLEM 24

The four constraints are:

400 X1 + 200 X2 + 150 X3 + 500 X4  500
3 X1 + 2 X2  6
2 X1 + 2 X2 + 4 X3 + 4 X4  10
2 X1 + 4 X2 + X3 + 5 X4  8
Nonnegativity constraints: it is clear that all decision variables
are restricted in sign, i.e., Xi  0, for all i = 1, 2, 3, and 4
 DIET PROBLEM 25

• Combining the objective function, constraints,

and nonnegativity constraints, the LP model is
as follows:
Min Z = 50 X1 + 20 X2 + 30 X3 + 80 X4
st.
400 X1 + 200 X2 + 150 X3 + 500 X4  500
3 X1 + 2 X2  6
2 X1 + 2 X2 + 4 X3 + 4 X4  10
2 X1 + 4 X2 + X3 + 5 X4  8
Xi  0, for all i = 1, 2, 3, and 4
The optimal solution to this LP is X1 = X4 = 0,
X2 = 3, X3 = 1 and Z = 90 cents
 3. BLENDING PROBLEM 26

Example
The Low Knock Oil company produces two grades of cut rate
gasoline for industrial distribution. The grades, regular and
economy, are produced by refining a blend of two types of crude
oil, type X100 and type X220. each crude oil differs not only in cost
per barrel, but in composition as well. The accompanying table
indicates the percentage of crucial ingredients found in each of
the crude oils and the cost per barrel for each. Weekly demand for
regular grade of Low Knock gasoline is at least 25000 barrels, while
demand for the economy is at least 32000 barrels per week. At
least 45% of each barrel of regular must be ingredient A. At most
50% of each barrel of economy should contain ingredient B. the
Low Knock management must decide how many barrels of each
type of crude oil to buy each week for blending to satisfy demand
at minimum cost .

Crude oil Ingredient Ingredient Cost/barrel

type A% B% ($)
X100 35 55 30
X220 60 25 34.8
 BLENDING PROBLEM 27

Solution
Let
X1 = # of barrels of crude X100 blended to produce the refined regular
X2 = # of barrels of crude X100 blended to produce the refined
economy
X3 = # of barrels of crude X220 blended to produce the refined regular
X4 = # of barrels of crude X220 blended to produce the refined
economy

Min Z = 30 X1 + 30 X2 + 34.8 X3 + 34.8 X4

St.
X1 + X3  25000
X2 + X4  32000
-0.10 X1 + 0.15 X3  0
0.05 X2 – 0.25 X4  0
Xi  0, i = 1, 2, 3, 4
The optimal solution is: X1 = 15000, X2 = 26666.6, X3 = 10000,
X4 = 5333.3, and Z = 1,783,600
 4. MEDIA SELECTION PROBLEM 28

Example
A company has budgeted up to $8000 per
week for local advertisement. The money is to
be allocated among four promotional media:
TV spots, newspaper ads, and two types of
radio advertisements. The company goal is to
reach the largest possible high-potential
audience through the various media. The
following table presents the number of
potential customers reached by making use of
advertisement in each of the four media. It
also provides the cost per advertisement
placed and the maximum number of ads that
can be purchased per week.
 MEDIA SELECTION 29

Medium Audience Cost per Maximum

Reached per ad ads per
ad week
TV spot (1 minute) 5000 800 12

Daily newspaper 8500 925 5

(full-page ad)
Radio spot 2400 290 25
(30 second, prime time)
Radio spot 2800 380 20
(1 minute, afternoon)

The company arrangements require that at least five radio spots

be placed each week. To ensure a board-scoped promotional
campaign, management also insists that no more than $1800 be
spent on radio advertising every week.
 MEDIA SELECTION 30

Solution
Let
X1 = number of 1-miute TV spots taken Each week
X2 = number of full-page daily newspaper ads taken each week.
X3 = number of 30-second prime-time radio spots taken each week.
X4 = number of 1-minute afternoon radio spots taken each week.

Max Z = 5000 X1 + 8500 X2 + 2400 X3 + 2800 X4

st
X1  12 (maximum TV spots/week)
X2  5 (maximum newspaper ads/week)
X3  25 (maximum 30-second radio spots/week)
X4  20 (maximum 1-minute radio spots/week)
800 X1 + 925 X2 + 290 X3 + 380 X4  8000 (weekly budget)
X3 + X4  5 (minimum radio spots contracted)
290 X3 + 380 X4  1800 (maximum dollars spent on radio)
X1, X2, X3, X4  0

The optimal solution is: X1 = 1.97, X2 = 5, X3 =6.2, and X4 = 0, Z = 67240

 5. ASSIGNMENT PROBLEM 31

Example
A law firm maintains a large staff of young attorneys
who hold the title of junior partner. The firm concerned
with the effective utilization of this personnel resources,
seeks some objective means of making lawyer-to-
client assignments. On march 1, four new clients
seeking legal assistance came to the firm. While the
current staff is overloads and identifies four junior
partners who, although busy, could possibly be
assigned to the cases. Each young lawyer can handle
at most one new client. Furthermore each lawyer
differs in skills and specialty interests.
Seeking to maximize the overall effectiveness of the new
client assignment, the firm draws up the following
table, in which he rates the estimated effectiveness (of
a scale of 1 to 9) of each lawyer on each new case.
 ASSIGNMENT PROBLEM 32

Client case

Lawyer Divorce Corporate embezzlement exhibitionism

merger

Adam 6 2 8 5

Brook 9 3 5 8

Carter 4 8 3 4

Darwin 6 7 6 4
 ASSIGNMENT PROBLEM 33

Solution
Decision variables:
1 if attorney i is assigned to case j
Let Xij =
0 otherwise
Where : i = 1, 2, 3, 4 stands for Adam, Brook,
Carter, and Darwin respectively
j = 1, 2, 3, 4 stands for divorce, merger,
embezzlement, and exhibitionism respectively.
The LP formulation will be as follows:
 ASSIGNMENT PROBLEM 34

Max Z = 6 X11 + 2 X12 + 8 X13 + 5 X14 + 9 X21 + 3 X22 +

5 X23 + 8 X24 + 4 X31 + 8 X32 + 3 X33 + 4 X34 +
6 X41 +7 X42 + 6 X43 + 4 X44
St.
X11 + X21 + X31 + X41 = 1 (divorce case)
X12 + X22 + X32 + X42 = 1 (merger)
X13 + X23 + X33 + X43 = 1 (embezzlement)
X14 + X24 + X34 + X44 = 1 (exhibitionism)
X11 + X12 + X13 + X14 = 1 (Adam)
X21 + X22 + X23 + X24 = 1 (Brook)
X31 + X32 + X33 + X34 = 1 (Carter)
X41+ X42 + X43 + X44 = 1 (Darwin)
The optimal solution is: X13 = X24 = X32 = X41 = 1. All other variables
are equal to zero.
 6. TRANSPORTATION PROBLEM 35

Example
The Top Speed Bicycle Co. manufactures and markets a
line of 10-speed bicycles nationwide. The firm has final
assembly plants in two cities in which labor costs are
low, New Orleans and Omaha. Its three major
warehouses are located near the larger market areas
of New York, Chicago, and Los Angeles.
The sales requirements for next year at the New York
warehouse are 10000 bicycles, at the Chicago
warehouse 8000 bicycles, and at the Los Angeles
warehouse 15000 bicycles. The factory capacity at
each location is limited. New Orleans can assemble
and ship 20000 bicycles; the Omaha plant can
produce 15000 bicycles per year. The cost of shipping
one bicycle from each factory to each warehouse
differs, and these unit shipping costs are:
 TRANSPORTATION PROBLEM
36

New Chicago Los

York Angeles
New Orleans $2 3 5

Omaha 3 1 4

The company wishes to develop a shipping

schedule that will minimize its total annual
transportation cost
 TRANSPORTATION PROBLEM 37

Solution
To formulate this problem using LP, we again employ the
concept of double subscribed variables. We let the first
subscript represent the origin (factory) and the second
subscript the destination (warehouse). Thus, in general,
Xij refers to the number of bicycles shipped from origin i
to destination j. Therefore, we have six decision
variables as follows:

X11 = # of bicycles shipped from New Orleans to New York

X12 = # of bicycles shipped from New Orleans to Chicago
X13 = # of bicycles shipped from New Orleans to Los Angeles
X21 = # of bicycles shipped from Omaha to New York
X22 = # of bicycles shipped from Omaha to Chicago
X23 = # of bicycles shipped from Omaha to Los Angeles
 TRANSPORTATION PROBLEM 38

Min Z = 2 X11 + 3 X12 + 5 X13 + 3 X21 + X22 + 4 X23

St
X11 + X21 = 10000 (New York demand)
X12 + X22 = 8000 (Chicago demand)
X13 + X23 = 15000 (Los Angeles demand)
X11 + X12 + X13  20000 (New Orleans Supply
X21 + X22 + X23  15000 (Omaha Supply)
Xij  0 for i = 1, 2 and j = 1, 2, 3
The optimal solution is: X11 = 10000, X12 = 0, X13 = 8000, X21 = 0, X22 =
8000, X23 = 7000, and Z = $96000
 7. PORTFOLIO SELECTION 39

Example
The International City Trust (ICT) invests in short-
term trade credits, corporate bonds, gold
stocks, and construction loans. To encourage a
diversified portfolio, the board of directors has
placed limits on the amount that can be
committed to any one type of investment. The
ICT has $5 million available for immediate
investment and wishes to do two things: (1)
maximize the interest earned on the
investments made over the next six months, and
(2) satisfy the diversification requirements as set
by the board of directors. The specifics of the
investment possibilities are:
 PORTFOLIO SELECTION 40

Investment Interest Maximum

earned investment
% ($ Million)
Trade credit 7 1
Corporate bonds 11 2.5
Gold stocks 19 1.5
Construction loans 15 1.8

In addition, the board specifies that at least

55% of the funds invested must be in gold
stocks and construction loans, and that no less
than 15% be invested in trade credit.
 PORTFOLIO SELECTION 41

Solution
To formulate ICT’s investment problem as a linear
programming model, we assume the following decision
variables:
X1 = dollars invested in trade credit
X2 = dollars invested in corporate bonds
X3 = dollars invested in gold stocks
X4 = dollars invested in construction loans
 PORTFOLIO SELECTION 42

Max Z = 0.07 X1 + 0.11 X2 + 0.19 X3 + 0.15 X4

St.
X1  1
X2  2.5
X3  1.5
X4  1.8
X3 + X4  0.55(X1 + X2 + X3 + X4)
X1  0.15(X1 + X2 + X3 + X4)
X1 + X 2 + X 3 + X 4  5
Xi  0 , i = 1, 2, 3, 4

The optimal is: X1 = 75,000, X2 = 950,000, X3 = 1,500,000,

and X4 = 1,800,000, and total interest
Z = 712,000
 8. Work Scheduling Problem 43

Example
Microsoft has a 24-hour-a-day, 7-days-a-week toll
free hotline that is being set up to answer questions
regarding a new product. The following table
summarizes the number of full-time equivalent
employees (FTEs) that must be on duty in each time
block.

Shift Time FTEs

1 0-4 15
2 4-8 10
3 8-12 40
4 12-16 70
5 16-20 40
6 20-0 35
 Work Scheduling problem 44

• Microsoft may hire both full-time and part-time

employees. The former work 8-hour shifts and the
latter work 4-hour shifts; their respective hourly
wages are $15.20 and $12.95. Employees may start
work only at the beginning of one of 6 shifts.

Part-time employees can only answer 5 calls in the

time a full-time employee can answer 6 calls. (i.e., a
part-time employee is only 5/6 of a full-time
employee.)

Formulate an LP to determine how to staff

the hotline at minimum cost.
Decision Variables
45

xt = # of full-time employees that begin work in shift t

yt = # of part-time employees that work shift t

(8  15.20) (4  12.95)
Min 121.6 (x1 + ••• + x6) + 51.8 (y1 + ••• + y 6)
5
s.t. x6 + x1 + 6
y1  15
5
x1 + x2 + 6
y2  10
5
All shifts
x2 + x3 + 6
y3  40 must be
5
x3 + x4 + 6
y4  70 covered
5
x4 + x5 + 6
y5  40
5
x5 + x6 + 6
y6  35
xt, yt  0
PT employee is 5/6 FT employee