Full file at

https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

SOLUTIONS MANUAL
For

INTRODUCTION TO
OPERATIONS RESEARCH
Ninth Edition

FREDERICK S. HILLIER
Stanford University

GERALD J. LIEBERMAN
Late of Stanford University

Prepared by
PELIN G. CANBOLAT

Download full file from buklibry.com

Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

TABLE OF CONTENTS

SOLUTIONS TO END-OF-CHAPTER PROBLEMS AND CASES

CHAPTER 1 Introduction 1-1

CHAPTER 2 Overview of the Operations Research Modeling Approach 2-1
CHAPTER 3 Introduction to Linear Programming 3-1
CHAPTER 4 Solving Linear Programming Problems: The Simplex Method 4-1
CHAPTER 5 The Theory of the Simplex Method 5-1
CHAPTER 6 Duality Theory and Sensitivity Analysis 6-1
CHAPTER 7 Other Algorithms for Linear Programming 7-1
Supplement to Chapter 7 7S-1
CHAPTER 8 The Transportation and Assignment Problems 8-1
CHAPTER 9 Network Optimization Models 9-1
CHAPTER 10 Dynamic Programming 10-1
CHAPTER 11 Integer Programming 11-1
CHAPTER 12 Nonlinear Programming 12-1
CHAPTER 13 Metaheuristics 13-1
CHAPTER 14 Game Theory 14-1
CHAPTER 15 Decision Analysis 15-1
CHAPTER 16 Markov Chains 16-1
CHAPTER 17 Queueing Theory 17-1
CHAPTER 18 Inventory Theory 18-1
Supplement 1 to Chapter 18 18S1-1
Supplement 2 to Chapter 18 18S2-1
CHAPTER 19 Markov Decision Processes 19-1
CHAPTER 20 Simulation 20-1
Supplement 1 to Chapter 20 20S1-1
Supplement 2 to Chapter 20 20S2-1
Supplement 3 to Chapter 20 20S3-1
CHAPTER 21 The Art of Modeling with Spreadsheets 21-1
CHAPTER 22 Project Management with PERT/CPM 22-1
CHAPTER 23 Additional Special Types of Linear Programming Problems 23-1
CHAPTER 24 Probability Theory 24-1
CHAPTER 25 Reliability 25-1
CHAPTER 26 The Application of Queueing Theory 26-1
CHAPTER 27 Forecasting 27-1
CHAPTER 28 Examples of Performing Simulations on Spreadsheets with Crystal Ball 28-1

Download full file from buklibry.com

Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

CHAPTER 1: INTRODUCTION

1.3-1.
Answers will vary.
1.3-2.
Answers will vary.
1.3-3.
By using operations research (OR), FedEx managed to survive crises that could drive it
out of business. The new planning system provided more flexibility in choosing the
destinations that it serves, the routes and the schedules. Improved schedules yielded into
faster and more reliable service. OR applied to this complex system with a lot of
interdependencies resulted in an efficient use of the assets. With the new system, FedEx
maintained a high load factor while being able to service in a reliable, flexible and
profitable manner. The model also enabled the company to foresee future risks and to
take measures against undesirable outcomes. The systematic approach has been effective
in convincing investors and employees about the benefits of the changes. Consequently,
"today FedEx is one of the nation's largest integrated, multi-conveyance freight carriers"
[p. 32].

1-1
Download full file from buklibry.com
Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

CHAPTER 2: OVERVIEW OF THE OPERATIONS RESEARCH

MODELING APPROACH

2.1-1.
(a) The rise of electronic brokerage firms in the late 90s was a threat against full-service
financial service firms like Merrill Lynch. Electronic trading offered very low costs,
which were hard to compete with for full-service firms. With banks, discount brokers and
electronic trading firms involved, the competition was fierce. Merrill Lynch needed an
urgent response to these changes in order to survive.
(b) "The group's mission is to aid strategic decision making in complex business
situations through quantitative modeling and analysis" [p.8].
(c) The data obtained for each client consisted of "data for six categories of revenue, four
categories of account type, nine asset allocation categories, along with data on number of
trades, mutual fund exchanges and redemptions, sales of zero coupon bonds, and
purchases of new issues" [p. 10].
(d) As a result of this study, two main pricing options, viz., an asset-based pricing option
and a direct online pricing option were offered to the clients. The first targeted the clients
who want advice from a financial advisor. The clients who would choose this option
would be charged at a fixed rate of the value of their assets and would not pay for each
trade. The latter pricing option was for the clients who want to invest online and who do
not want advice. These self-directed investors would be charged for every trade.
(e) "The benefits were significant and fell into four areas: seizing the marketplace
initiative, finding the pricing sweet spot, improving financial performance, and adopting
the approach in other strategic initiatives" [p.15].
2.1-2.
(a) This study arose from GM's efforts to survive the competition of the late 80s. Various
factors, including the rise of foreign imports, the increase in customer expectations and
the pricing constraints, forced GM to close plants and to incur large financial losses.
While trying to copy Japanese production methods directly, GM was suffering from
"missing production targets, working unscheduled overtime, experiencing high scrap
costs, and executing throughput-improvement initiatives with disappointing results" [p.
7]. The real problems were not understood and the company was continuously losing
money while the managers kept disagreeing about solutions.
(b) The goal of this study was "to improve the throughput performance of existing and
new manufacturing systems through coordinated efforts in three areas: modeling and
algorithms, data collection, and throughput-improvement processes" [p. 7].
(c) The data collection was automated by using programmable logic controllers (PLCs).
The software kept track of the production events including "machine faults and blocking
and starving events" [p. 13] and recorded their duration. The summary of this data was
then transferred to a centralized database, which converted this to workstation-
performance characteristics and used in validating the models, determining the bottleneck
processes and enhancing throughput.
(d) The improved production throughput resulted in more than $2.1 billion in
documented savings and increased revenue.
2-1
Download full file from buklibry.com
Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

2.1-3.

2-2
Download full file from buklibry.com
Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

6.1-8.
Primal: maximize B"  B#
subject to B"  B# Ÿ "
B"  B# Ÿ !
B" ß B#   !
Let B" œ B# œ - Ä _, ^ œ #- is unbounded.
Dual: minimize C"
subject to C"  C#   "
C"  C#   "
C" ß C#   !
The dual problem is infeasible.

6-5
Download full file from buklibry.com
Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

Download full file from buklibry.com 6-105

Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

CHAPTER 11: INTEGER PROGRAMMING

11.1-1.

B4 œ œ
" if the decision is to build a factory in city 4,
(a)
! otherwise

C4 œ œ
" if the decision is to build a factory in city 4,
! otherwise
for 4 œ LA, SF, SD.
maximize NPV œ *BLA  &BSF  (BSD  'CLA  %CSF  &CSD
subject to 'BLA  $BSF  %BSD  &CLA  #CSF  $CSD Ÿ "!
CLA  CSF  CSD Ÿ "
BLA  CLA Ÿ !
BSF  CSF Ÿ !
BSD  CSD Ÿ !
BLA ß BSF ß BSD ß CLA ß CSF ß CSD binary
(b) - (c)

11.1-2.

Q4 œ œ G4 œ œ
" if 4 does marketing, " if 4 does cooking,
(a)
! otherwise ! otherwise

H4 œ œ P4 œ œ
" if 4 does dishwashing, " if 4 does laundry,
! otherwise ! otherwise
for 4 œ E ÐEveÑß S ÐStevenÑ.
min T œ %Þ&QE  (Þ)GE  $Þ'HE  #Þ*PE  %Þ*QS  (Þ#GS  %Þ$HS  $Þ"PS
st QE  GE  HE  PE œ #
QS  GS  HS  PS œ #
QE  QS œ "
GE  GS œ "
H E  HS œ "
PE  PS œ "
QE ß QS ß GE ß GS ß HE ß HS ß PE ß PS binary

11-1
Download full file from buklibry.com
Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

12.9-5.
(a)

(b)

12.9-6.

12.9-7.

12-41
Download full file from buklibry.com
Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

15.5-1.
(a)
State of Nature
Alternative Sell "!ß !!! Sell "!!ß !!!
Build Computers ! &%
Sell Rights "& "&

They should build computers with an expected payoff of $#( million.

(b)

15-35
Download full file from buklibry.com
Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

(b) Optimal Order Quantity

Current Order Quantity

(c)

(d) VST œ &  Ð&!ÑÐ&Î#&Ñ œ "& hammers, which adds & ‚ $% œ $#! to TVC every
month, $#%! per year.
18.3-7.
O œ "#ß !!!, 2 œ !Þ$!, . œ )ß !!!, : œ &

U‡ œ É #Ð)!!!ÑÐ"#!!!Ñ É &!Þ$! œ #'ß !%'

W ‡ œ É #Ð)!!!ÑÐ"#!!!Ñ
!Þ$! &

!Þ$! É &!Þ$!
&
œ #%ß &(#
>‡ œ U‡ Î. œ $Þ#' months

18-5
Download full file from buklibry.com
Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

20.6-4.
The chance of negative clearance is approximately ")Þ%%.
A B C D E F
1 Shaft Radius 1.001 Triangular(min,likely,max) 1.000 1.001 1.002
2 Bushing Radius 1.002 Normal(mean,st.dev.) 1.002 0.001
3
4 Clearance 0.0010

20-40
Download full file from buklibry.com
Full file at
https://buklibry.com/download/instructors-solutions-manual-introduction-to-operations-research-9th-edition-by-hillier-lieberman/

(b) The cost and requirements table of the equivalent transportation problem is identical
to the one in (a) except that all supplies and demands need to be increased by one.
(c)
" # $ % & Supply
" " " #
# " "
$ " "
% " "
& " "
Demand " " " " # Cost: *ß '!!
The optimal solution is to purchase a very old car for year 1 and a moderately old one for
years 2, 3, and 4. The cost of this is $*ß '!!.
23.1-4.
Suppose there are 7 supply centers, 8 receiving centers and : transshipment points.

! ! -34 B34
78: 78:
minimize

Ú=
3œ" 4œ"

! ÐB34  B43 Ñ œ Û .3

78: 3 for 3 œ "ß #ß á ß 7

Ü!
subject to for 3 œ 7"ß á ß 78
4œ" for 3 œ 78"ß á ß 78:
B34   !, for all 3 Á 4
This model has the special structure that each decision variable appears in exactly two
constraints, once with a coefficient of " and once with a coefficient of ". The table of
constraint coefficients is:
B"# B"$ â B"ß78: B#" B#$ â B#ß78: â B78:ß" B78:ß# â B78:ß78:"
" " â " " ! â ! â " ! â !
" ! â ! " " â " â ! " â !
ã ã ã ã ã ã ã ã ã
! ! â " ! ! â " â " " â "

23.2-1.
(a) Maximize #B"  %B#  $B$  #B%  &B&  $B'
Master Problem &B"  #B#  $B$  %B%  #B&  B' Ÿ #!
#B"  %B#  #B%  $B' Ÿ '!
Subproblem 1 $B"  #B#  $B$ Ÿ $!
&B"  B$ Ÿ $!
B"  #B#  B$   #!
Subproblem 2 B% Ÿ "&
B%  $
Subproblem 3 #B&  B' Ÿ #!
#B&  $B' Ÿ %!
B4   !, for 4 œ "ß #ß á ß '

23-4
Download full file from buklibry.com