Operations Research Applications and Algorithms 4th Edition by Wayne Winston ISBN 9780357907818 0357907817 Instant Download
Operations Research Applications and Algorithms 4th Edition by Wayne Winston ISBN 9780357907818 0357907817 Instant Download
https://ebookball.com/product/operations-research-applications-
and-algorithms-4th-edition-by-wayne-winston-
isbn-9780357907818-0357907817-15570/
https://ebookball.com/product/algorithms-4th-edition-by-robert-
sedgewick-kevin-wayne-032157351x-978-0321573513-15262/
https://ebookball.com/product/algorithms-4th-edition-by-robert-
sedgewick-kevin-wayne-032157351x-978-0321573513-15224/
https://ebookball.com/product/microsoft-excel-2013-data-analysis-and-
business-modeling-1st-edition-by-wayne-winston-
isbn-b00jdmpo7u-9780735669130-15888/
https://ebookball.com/product/gray-anatomy-for-students-4th-edition-
by-richard-drake-wayne-vogl-adam-mitchell-
isbn-9780323508520-0323508529-250/
https://ebookball.com/product/data-structures-algorithms-and-
applications-in-c-1st-edition-by-adam-drozdek-
isbn-1133608426-9781133608424-17250/
https://ebookball.com/product/gray-anatomy-for-students-4th-edition-
by-richard-drake-wayne-vogl-adam-
mitchell-9780323508520-0323508529-17880/
Eli Daisy produces Wozac in huge batches by heating a chemical mixture in a pressur-
ized container. Each time a batch is processed, a different amount of Wozac is produced.
The amount produced is the process yield (measured in pounds). Daisy is interested in
understanding the factors that influence the yield of the Wozac production process. De-
scribe a model-building process for this situation.
Solution Daisy is first interested in determining the factors that influence the yield of the process.
This would be referred to as a descriptive model, because it describes the behavior of the
actual yield as a function of various factors. Daisy might determine (using regression
methods discussed in Chapter 24) that the following factors influence yield:
■ container volume in liters (V)
■ container pressure in milliliters (P)
■ container temperature in degrees Celsius (T)
■ chemical composition of the processed mixture
If we let A, B, and C be percentage of mixture made up of chemicals A, B, and C, then
Daisy might find, for example, that
(1) yield 300 .8V .01P .06T .001T*P .01T2 .001P2
11.7A 9.4B 16.4C 19A*B 11.4A*C 9.6B*C
To determine this relationship, the yield of the process would have to be measured for
many different combinations of the previously listed factors. Knowledge of this equation
would enable Daisy to describe the yield of the production process once volume, pres-
sure, temperature, and chemical composition were known.
Most of the models discussed in this book will be prescriptive or optimization models.
A prescriptive model “prescribes” behavior for an organization that will enable it to best
meet its goal(s). The components of a prescriptive model include
■ objective function(s)
■ decision variables
■ constraints
In short, an optimization model seeks to find values of the decision variables that opti-
mize (maximize or minimize) an objective function among the set of all values for the
decision variables that satisfy the given constraints.
Naturally, Daisy would like to maximize the yield of the process. In most models, there
will be a function we wish to maximize or minimize. This function is called the model’s
objective function. Of course, to maximize the process yield we need to find the values
of V, P, T, A, B, and C that make (1) as large as possible.
In many situations, an organization may have more than one objective. For example, in
assigning students to the two high schools in Bloomington, Indiana, the Monroe County
School Board stated that the assignment of students involved the following objectives:
■ Equalize the number of students at the two high schools.
■ Minimize the average distance students travel to school.
■ Have a diverse student body at both high schools.
Multiple objective decision-making problems are discussed in Sections 4.14 and 11.13.
The variables whose values are under our control and influence the performance of the
system are called decision variables. In our example, V, P, T, A, B, and C are decision
variables. Most of this book will be devoted to a discussion of how to determine the value
of decision variables that maximize (sometimes minimize) an objective function.
Constraints
In most situations, only certain values of decision variables are possible. For example, cer-
tain volume, pressure, and temperature combinations might be unsafe. Also, A B, and C
must be nonnegative numbers that add to 1. Restrictions on the values of decision vari-
ables are called constraints. Suppose the following:
After letting z represent the value of the objective function, our entire optimization model
may be written as follows:
Maximize z 300 .8V .01P .06T .001T*P .01T2 .001P2
11.7A 9.4B 16.4C 19A*B 11.4A*C 9.6B*C
Subject to (s.t.)
V5
V1
P 400
P 200
T 200
T 100
A0
B0
C0
ABC1
A5
Any specification of the decision variables that satisfies all of the model’s constraints is
said to be in the feasible region. For example, V 2, P 300, T 150, A .4, B
.3, and C .1 is in the feasible region. An optimal solution to an optimization model is
any point in the feasible region that optimizes (in this case, maximizes) the objective func-
tion. Using the LINGO package that comes with this book, it can be determined that the
optimal solution to this model is V 5, P 200, T 100, A .294, B 0, C .706,
and z 183.38. Thus, a maximum yield of 183.38 pounds can be obtained with a 5-liter
1 . 1 An Introduction to Modeling 3
container, pressure of 200 milliliters, temperature of 100 degrees Celsius, and 29% A and
71% C. This means no other feasible combination of decision variables can obtain a yield
exceeding 183.38 pounds.
A static model is one in which the decision variables do not involve sequences of deci-
sions over multiple periods. A dynamic model is a model in which the decision variables
do involve sequences of decisions over multiple periods. Basically, in a static model we
solve a “one-shot” problem whose solutions prescribe optimal values of decision variables
at all points in time. Example 1 is an example of a static model; the optimal solution will
tell Daisy how to maximize yield at all points in time.
For an example of a dynamic model, consider a company (call it Sailco) that must de-
termine how to minimize the cost of meeting (on time) the demand for sailboats during
the next year. Clearly Sailco’s must determine how many sailboats it will produce during
each of the next four quarters. Sailco’s decisions involve decisions made over multiple pe-
riods, hence a model of Sailco’s problem (see Section 3.10) would be a dynamic model.
Suppose that whenever decision variables appear in the objective function and in the con-
straints of an optimization model, the decision variables are always multiplied by constants
and added together. Such a model is a linear model. If an optimization model is not lin-
ear, then it is a nonlinear model. In the constraints of Example 1, the decision variables
are always multiplied by constants and added together. Thus, Example 1’s constraints pass
the test for a linear model. However, in the objective function for Example 1, the terms
.001T*P, .01T2, 19A*B, 11.4A*C, and 9.6B*C make the model nonlinear. In general,
nonlinear models are much harder to solve than linear models. We will discuss linear
models in Chapters 2 through 10. Nonlinear models will be discussed in Chapter 11.
If one or more decision variables must be integer, then we say that an optimization model
is an integer model. If all the decision variables are free to assume fractional values, then
the optimization model is a noninteger model. Clearly, volume, temperature, pressure,
and percentage composition of our inputs may all assume fractional values. Thus, Exam-
ple 1 is a noninteger model. If the decision variables in a model represent the number of
workers starting work during each shift at a fast-food restaurant, then clearly we have an
integer model. Integer models are much harder to solve than nonlinear models. They will
be discussed in detail in Chapter 9.
Suppose that for any value of the decision variables, the value of the objective function
and whether or not the constraints are satisfied is known with certainty. We then have a
deterministic model. If this is not the case, then we have a stochastic model. All mod-
els in the first 12 chapters will be deterministic models. Stochastic models are covered in
Chapters 13, 16, 17, and 19–24.
Step 1 Klingman et al. wanted to minimize the cost of operating CITGO’s refineries.
Step 2 The Lake Charles, Louisiana, refinery was closely observed in an attempt to es-
timate key relationships such as:
1 How the cost of producing each of CITGO’s products (motor fuel, no. 2 fuel oil, tur-
bine fuel, naptha, and several blended motor fuels) depends on the inputs used to produce
each product.
2 The amount of energy needed to produce each product. This required the installation
of a new metering system.
3 The yield associated with each input–output combination. For example, if 1 gallon of
crude oil would yield .52 gallons of motor fuel, then the yield would equal 52%.
4 To reduce maintenance costs, data were collected on parts inventories and equipment
breakdowns. Obtaining accurate data required the installation of a new database-management
system and integrated maintenance-information system. A process control system was also
installed to accurately monitor the inputs and resources used to manufacture each product.
Step 3 Using linear programming (LP), a model was developed to optimize refinery op-
erations. The model determines the cost-minimizing method for mixing or blending to-
gether inputs to produce desired outputs. The model contains constraints that ensure that
inputs are blended so that each output is of the desired quality. Blending constraints are
discussed in Section 3.8. The model ensures that plant capacities are not exceeded and al-
1.5 GE Capital
GE Capital provides credit card service to 50 million accounts. The average total out-
standing balance exceeds $12 billion. GE Capital, led by Makuch et al. (1989), developed
the PAYMENT system to reduce delinquent accounts and the cost of collecting from
delinquent accounts.
Step 1 At any one time, GE Capital has more than $1 billion in delinquent accounts.
The company spends $100 million per year processing these accounts. Each day, workers
contact more than 200,000 delinquent credit card holders with letters, messages, or live
calls. The company’s goal was to reduce delinquent accounts and the cost of processing
them. To do this, GE Capital needed to come up with a method of assigning scarce labor
resources to delinquent accounts. For example, PAYMENT determines which delinquent
accounts receive live phone calls and which delinquent accounts receive no contact.
Step 2 The key to modeling delinquent accounts is the concept of a delinquency move-
ment matrix (DMM). The DMM determines how the probability of the payment on a
delinquent account during the current month depends on the following factors: size of un-
paid balance (either $300 or $300), action taken (no action, live phone call, taped
message, letters), and a performance score (high, medium, or low). The higher the per-
formance score associated with a delinquent account, the more likely the account is to be
collected. Table 1 lists the probabilities for a $250 account that is two months delinquent,
has a high performance score, and is contacted with a phone message.
TA B L E 1
Sample Entries in DMM
Event Probability
Because GE Capital has millions of delinquent accounts, there is ample data to accu-
rately estimate the DMM. For example, suppose there were 10,000 two-month delinquent
accounts with balances under $300 that have a high performance score and are contacted
with phone messages. If 3,000 of those accounts were completely paid off during the cur-
rent month, then we would estimate the probability of an account being completely paid
off during the current month as 3,000/10,000 .30.
1 . 5 GE Capital 9
Step 3 GE Capital developed a linear optimization model. The objective function for the
PAYMENT model was to maximize the expected delinquent accounts collected during the
next six months. The decision variables represented the fraction of each type of delinquent
account (accounts are classified by payment balance, performance score, and months
delinquent) that experienced each type of contact (no action, live phone call, taped mes-
sage, or letter). The constraints in the PAYMENT model ensure that available resources
are not overused. Constraints also relate the number of each type of delinquent account
present in, say, January to the number of delinquent accounts of each type present during
the next month (February). This dynamic aspect of the PAYMENT model is crucial to its
success. Without this aspect, the model would simply “skim” the accounts that are easi-
est to collect each month. This would result in few collections during later months.
Step 4 PAYMENT was piloted on a $62 million portfolio for a single department store.
GE Capital managers came up with their own strategies for allocating resources (collec-
tively called CHAMPION). The store’s delinquent accounts were randomly assigned to
the CHAMPION and PAYMENT strategies. PAYMENT used more live phone calls and
more “no action” than the CHAMPION strategies. PAYMENT also collected $180,000
per month more than any of the CHAMPION strategies, a 5% to 7% improvement. Note
that using more of the no-action strategy certainly leads to a long-run increase in cus-
tomer goodwill!
Step 5 As described in step 3, for each type of account, PAYMENT tells the credit man-
agers the fraction that should receive each type of contact. For example, for three-month
delinquent accounts with a small ($300) unpaid balance and high performance score,
PAYMENT might prescribe 30% no action, 20% letters, 30% phone messages, and 20%
live phone calls.
Steps 6 and 7 PAYMENT was next applied to the 18 million accounts of the $4.6 billion
Montgomery-Ward department store portfolio. Comparing the collection results to the
same time period a year earlier, it was found that PAYMENT increased collections by $1.6
million per month (more than $19 million per year). This is actually a conservative esti-
mate of the benefit obtained from PAYMENT, because PAYMENT was first applied to
the Montgomery-Ward portfolio during the depths of a recession—and a recession makes
it much more difficult to collect delinquent accounts.
Overall, GE Capital estimates that PAYMENT increased collections by $37 million per
year and used fewer resources than previous strategies.
REFERENCES
Klingman, D., N. Phillips, D. Steiger, and W. Young, “The Economy: A Multi-Billion Dollar Management Science
Successful Deployment of Management Science Application,” Interfaces 22 (1992, no. 1):90–109.
Throughout Citgo Corporation,” Interfaces 17 (1987, Taylor, P., and S. Huxley, “A Break from Tradition for the
no. 1):4–25. San Francisco Police: Patrol Officer Scheduling Using
Makuch, W., J. Dodge, J. Ecker, D. Granfors, and G. Hahn, an Optimization-Based Decision Support Tool,” Inter-
“Managing Consumer Credit Delinquency in the US faces 19 (1989, no. 1):4–24.
In this chapter, we study the topics in linear algebra that will be needed in the rest of the book.
We begin by discussing the building blocks of linear algebra: matrices and vectors. Then we
use our knowledge of matrices and vectors to develop a systematic procedure (the Gauss–
Jordan method) for solving linear equations, which we then use to invert matrices. We close
the chapter with an introduction to determinants.
The material covered in this chapter will be used in our study of linear and nonlinear
programming.
For example,
3 4, 4 2,
1 2 1 2 3 1
, [2 1]
5 6
are all matrices.
If a matrix A has m rows and n columns, we call A an m n matrix. We refer to
m n as the order of the matrix. A typical m n matrix A may be written as
a11 a12 a1n
a21 a22 a2n
A
am1 am2 mn
a
DEFINITION ■ The number in the ith row and jth column of A is called the ijth element of A
and is written aij. ■
For example, if
1 2 3
A 4 5 6
7 8 9
then a11 1, a23 6, and a31 7.
Sometimes we will use the notation A [aij] to indicate that A is the matrix whose
ijth element is aij.
DEFINITION ■ Two matrices A [aij] and B [bij] are equal if and only if A and B are of the
same order and for all i and j, aij bij. ■
For example, if
3 4 w z
1 2 x y
A and B
Vectors
Any matrix with only one column (that is, any m 1 matrix) may be thought of as a column
vector. The number of rows in a column vector is the dimension of the column vector. Thus,
2
1
0
0
[0 0] and
2
1
u
0
0
to the point
2
1
x1
–2 –1 1 2
w
–1
v
(–1, –2)
–2
FIGURE 1
(1, –3)
Vectors Are Directed –3
Line Segments
v1
v2
v
vn
of the same dimension. The scalar product of u and v (written u v) is the number
u1v1 u2v2 unvn.
For the scalar product of two vectors to be defined, the first vector must be a row vec-
tor and the second vector must be a column vector. For example, if
2
u [1 2 3] and v 1
2
then u v 1(2) 2(1) 3(2) 10. By these rules for computing a scalar product, if
2
1
u and v [2 3]
4
3
u [1 2 3] and v
then u v is not defined because the vectors are of two different dimensions.
Note that two vectors are perpendicular if and only if their scalar product equals 0.
Thus, the vectors [1 1] and [1 1] are perpendicular.
We note that u v u v cos u, where u is the length of the vector u and u is the
angle between the vectors u and v.
We now describe the arithmetic operations on matrices that are used later in this book.
x2
v= 2 1
u= 1 2
3
u+v = 3 3 (3, 3)
(1, 2)
2
u+v
u
1 (2, 1)
v
(0, 0)
x1
FIGURE 2 1 2 3
Addition of Vectors
u c = 1
2
1
c = 2
c = 0
1 v
FIGURE 3
Line Segment Joining
u (1, 2) and 1 2
x1
v (2, 1)
a11 a12 a1n
a21 a22 a2n
A
am1 am2 amn
the transpose of A (written AT) is the n m matrix
a11 a21 am1
a12 a22 am2
A
T
a1n a2n mn
a
x2
u c = 0
1
c = 2
u c = 1
v
v
x1
–u v – u
FIGURE 4
Representation of Line
Segment uv
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookball.com