Mathematical - Optimization in Management of Services
Mathematical - Optimization in Management of Services
Mathematical Optimization
in the Management of Services
Jess Boronico
Dept. of Management/Marketing
School of Business Administration
Monmouth University
West Long Branch, NJ 07764–1898
[email protected]
Introduction
While students versed in mathematics are often exposed to methodologies
involved in solving mathematical models, less often do they see integrated
models that utilize constructs across disciplines, each dependent upon mathe-
matics for the development of optimal solutions to real-world problems. This
paper discusses one such model, where mathematical programming, statistics,
and microeconomics are unified. The model, when expanded, can prove useful
in applied, real-world problems [Boronico 1996].
We illustrate, for a monopolistic service provider facing stochastic demand,
how reliability of service impacts on marginal costs (within which optimal
price is embodied) and capacity decisions. We discuss pricing in a monopoly,
develop the model, and analyze the model to arrive at both optimal capacities
and price. Then we present illustrative examples, followed by supporting
numerical results and concluding comments.
Pricing in a Monopoly
Quality service and consumer satisfaction have become realities for many
service-oriented industries. To implement timely service within these indus-
tries, capacity plans must provide for adequate staffing during both peak-load
and off-peak hours, incorporating probabilistic demand.
The 1980s and 1990s have illustrated how quality management can affect
the profitability of many industries once thought to be immune from competi-
tion, such as the telecommunications industry and postal services [Adie 1989].
Mathematical models, combined with classical economic and statistical the-
ory, yield meaningful results and insights into the nature of optimal operating
policies [Boronico et al. 1995; Boronico et al. 1996]. The results of this paper’s
The UMAP Journal 18 (1) (1997) 15–34. °Copyright
c 1997 by COMAP, Inc. All rights reserved.
Permission to make digital or hard copies of part or all of this work for personal or classroom use
is granted without fee provided that copies are not made or distributed for profit or commercial
advantage and that copies bear this notice. Abstracting with credit is permitted, but copyrights
for components of this work owned by others than COMAP must be honored. To copy otherwise,
to republish, to post on servers, or to redistribute to lists requires prior permission from COMAP.
16 The UMAP Journal 18.1 (1997)
• the decrease in quantity demanded (the movement along the new demand
curve) caused by the increase in price attendant with greater reliability.
While the question of optimal reliability level is an important one, of equal im-
portance are the specific issues discussed in this paper, namely, cost-minimizing
capacity plans and welfare-optimal pricing policies that satisfy a prespecified
constraint on quality, with a reliability level determined ex-ante (in advance).
Model Development
Reliability
A monopolist is free to choose between various price/output combinations
(subject to regulation). Monopolists ordinarily attempt to maximize social wel-
fare, that is, the difference between consumers’ aggregate willingness to pay for
a product/service and the total costs involved in providing the required level
of output. Welfare-optimal prices should be equated to reliability-constrained
marginal cost [Crew and Kleindorfer 1992], and we apply this result in the
model developed here to illustrate how these prices are obtained. Similarly,
Mathematical Optimization 17
optimal capacities should be set to minimize the overall expected cost of meet-
ing the prespecified reliability.
Delivery services and postal systems may have a particular technology for
processing preferential mail (e.g., overnight express mail), such as optical char-
acter recognition systems, barcode sorters, and video encoding technologies.
Arrivals of incoming mail are received at the beginning of given periods, or
tours. For this mail to reach its destination on time, it must be processed within
a critical window during its tour of arrival. Postal services can never guarantee
processing all mail within this window, due to uncertainty in the volume of ar-
rivals. However, the inclusion of a reliability constraint on service allows them
to plan, ahead of time, the required capacity to install to meet certain stated
reliability, such as the overnight standard set for express mail service. When
incoming mail volume exceeds installed capacity, mail must be expedited at
additional cost. This type of the reliability condition may be reworded more
generally as follows:
Capacity decisions must be made so that the expected number of un-
processed arrivals at the end of the planning horizon must be less than or
equal to a prespecified fraction (1 − r) of the expected volume of arrivals
in that period.
The variable r represents the reliability of the system. Although more com-
plex models might involve the actual determination of the optimal reliability
level, reliability is declared ex-ante in the formulation considered here.
The Model
We address two specific issues:
• the price (P ) to charge for a particular service, and
• the level of capacity to install (Q) in order to satisfy demand while providing
adequate service quality.
Arrivals to the system occur in batches at the beginning of the planning
horizon. (If dynamic arrivals are permitted, the problem becomes increasingly
complex due to the required queuing analysis.) The number (X) of arrivals to
the system is governed by a cumulative distribution function F (k) = Pr(X ≤
k), with X a continuous random variable. Units are processed using regular-
time capacity ($b/unit); any excess demand (X > Q) demand is processed
using overtime ($B/unit) or some other form of penalty technology (B > b).
A constraint is appended to guarantee that an ex-ante declared service level
is adhered to with a certain reliability (probability). At optimal capacity, it may
be that the postal service exceeds the ex-ante declared reliability without the
imposition of the reliability constraint; in this case, the reliability constraint
may be used to determine the actual reliability offered by the postal service,
referred to as the implied reliability of the system.
We use the notation and definitions of Table 1.
18 The UMAP Journal 18.1 (1997)
Table 1.
Notation.
f(Q,X)
H(Q,X)
C(Q,X)
f (Q,X)
1
f 2 (Q,X)
Q
X
• is bounded from below (being the sum of nonnegative terms) and is greater
than or equal to zero, and
• approaches infinity as Q → ∞.
Thus, standard arguments [Wismer and Chattergy 1978] establish that over the
nonnegative orthant Q ≥ 0, the function E[C(Q, X)] has a global unconstrained
minimum, call it C ∗ , at some value Q∗ . Note that C ∗ is a function of Q∗ and
depends on the probability distribution of X, though not on X itself.
∂L(Q, X)
= b − T (B + λ) = 0, (8)
∂Q
where
T = Pr{X ≥ Q}. (9)
Solving (7)–(8) will produce optimum capacity Q∗ .
Optimal Price
In addition to the optimal capacity Q∗ and the optimal cost C ∗ , we are also
interested in the optimal price. For a monopolist, optimal price equals average
reliability-constrained marginal optimum cost—that is, the average value of
∂C ∗ /∂X, or · ∗¸
∗ ∂C
MC = E . (10)
∂X
At this point there is something of a conceptual problem. We would like
to examine how C ∗ changes with changes in X, but in fact X has been inte-
grated out in C and L. What then are we doing? In effect, we are considering
what happens to the optimal cost C ∗ if we add a little more demand at each
point of the probability distribution for X—that is, if we move the probability
distribution curve to the right by dX (average demand rises by dX).
To accomplish this, we turn to the different optimization problem without
taking expected values—that is, the problem to
This puts us in the situation of Silberberg [1978, 170], with X taking the role of
Silberberg’s α.† The envelope theorem (Silberberg [1978, 171, Eq. 6–90; Samuel-
son [1947, 34–35, 243]) tells us that
∂C ∗ ∂L
= .
∂X ∂X
Hence we have
· ¸ · ¸ · ¸
∗ ∂C ∗ ∂L ∂C ∂H
MC = E =E =E +λ
∂X ∂X ∂X ∂X
= T B + λ[T − (1 − r)] = T (B + λ) − (1 − r)λ. (11)
L with respect to Q do not exist along the line Q = X in the QX plane. Again, this obstacle can
be overcome.
Mathematical Optimization 23
Illustrative Examples
For illustrative purposes in determining optimal capacity and price from the
model (4)–(5), we consider two particular demand distributions, the continuous
uniform distribution and the triangular distribution, both on [l, u].
b(u − l)
Q∗ = u − . (13)
B
24 The UMAP Journal 18.1 (1997)
This is the optimal capacity for the unconstrained problem given by (4), or
the constrained problem under the condition that the constraint (5) is inactive
(referred to as the unconstrained solution). Note that Q → l as b → B, which
suggests that installed capacity should approach the minimum demand level
as regular-time costs approach overtime costs. Also note that (13) yields the
following desired result: l ≤ Q ≤ U as long as b < B. In other words, it would
never be optimal to install capacity outside of the feasible range of demand
values, a conclusion that agrees with intuition.
Note that the mean for X, E[X], has been replaced with the mean for the
uniform distribution, (u + l)/2. We solve (14) for Q:
p
Q = u ± (1 − r)(u + l)(u − l).
Since the integral in (14) must yield a positive value, we conclude that Q < u.
Consequently, the unique solution to (14), and the resulting optimal solution
to (4)–(5) when (5) is active, becomes
p
Q = u − (1 − r)(u + l)(u − l). (15)
b2 (u − l)
rI = 1 − .
B 2 (u + l)
Note that increases in B relative to b increase the implied reliability. This fact
may be explained by noting that increased overtime cost would lead to a higher
level of installed capacity, which would in turn increase the system’s reliability.
Marginal Cost
For the unconstrained case, set λ = 0. Substitution of (12) and (13) into (11)
eventually yields the result that the marginal cost for this case, call it M Cu ,
Mathematical Optimization 25
Marginal Cost
MC = b
0
Reliability
r
I 1.0
Optimal Capacity
We now compare the optimal capacities for the uniform distribution and
the triangular distribution. A direct algebraic comparison of (15), (16), and (13)
yields the following interesting result (see Figure 3):
Optimal Capacity
u
Triangular Solution
l+u
2
Uniform Solution
b
x=
u B
0.5 1.0
u-l
This relationship has intuitive appeal. Note that for cases where the penalty
cost is very large relative to the regular-time cost (i.e., b/B < 1/2), a higher vari-
ance encourages greater levels of installed capacity so as to protect against the
chance of excess demand, which in turn increases the use of penalty technology.
One may also explain this result geometrically by defining Pr{X ≥ Q} = Tt
if the demand distribution is triangular, and Pr{X ≥ Q} = Tu if the demand
distribution is uniform. Consider the case where b/B < 1/2. This implies that
Q ≥ (u + l)/2. A direct comparison between Tt and Tu for this case yields
Tu ≥ Tt , as illustrated in Figure 4.
Noting that T represents the probability that demand will exceed capacity,
necessitating overtime, we see that for a fixed level of capacity there is a greater
28 The UMAP Journal 18.1 (1997)
f(X) u+l
For Q >
Triangular Distribution 2
T = II + III > I + III = T
Uniform Distribution u t
2
u-l
1 I
u-l
II
III
X
u+l
l u
2
Q
Numerical Results
For each case, the following base parameters will apply:
Regular-time cost = b = $8.00,
Overtime cost = B = $12.00,
Lower and upper limits for demand: l = 100, u = 200.
We examine sensitivity of the results of the model—optimal capacity and
optimal price—to the impact of various changes.
Sensitivity to Reliability
We vary the reliability level between .85 and 1.0; results for the uniform
distribution are shown in Figure 5. As expected, capacity increases as relia-
bility increases, but only when the reliability constraint is binding (r > .8518).
Mathematical Optimization 29
Note that the capacity required to meet this increased reliability increases at
an increasing rate with respect to r. In fact, as r → 1, the capacity required
approaches infinity (evaluate limr→1 H(Q, X) directly).
Results regarding price are also as expected; namely, optimal price is con-
stant for nonbinding instances and first decreases, then increases, when the
reliability constraint is active. The optimal price approaches the regular-time
cost as r → 1, the same result that would obtain under deterministic conditions
when meeting a fractile of the demand with certainty [Crew and Kleindorfer
1986].
Price 8.00
7.50
Capacity
133
Reliability
.85 .90 .95 1.00
Capacity Price
( Units) ($)
$8.00
166
Price
$6.82
133
Capacity
Demand
Limits
[100, 200] [50, 250] [0, 300]
7.80
250 Price
7.57
Capacity
161
Mean
Demand
150 200 250
• The unconstrained optimal capacity (which is initially lower than that which
is required by the reliability constraint) increases.
11.01
183
Price
Capacity
145
2.00
Per Unit
Cost$b
2 7 12
Figure 8. Impact of regular time per unit processing cost on capacity and price.
32 The UMAP Journal 18.1 (1997)
Capacity ( Units)
200
Uniform
Triangular
100
Per Unit
Cost$b
0 5 10
Concluding Comments
The integration of principles of mathematics, statistics, and economics al-
lows for development of powerful methodologies involving capacity planning
and pricing. In a global economy where the threat of competition is a salient
element in a monopoly’s quest to remain viable, the determination of opti-
mal operating policies is necessary; anything less allows for the emergence of
inefficient entry and a simultaneous decrease in overall welfare.
The determination of true optimal policies involves the incorporation of
many real-world features. For example, in nature, demand is commonly sto-
chastic, although many models visualize demand as deterministic or static.
Furthermore, as illustrated in the section on numerical results, the variability
of the demand distribution plays an important role in operating policies such
as capacity planning and price determination. Consequently, it is not enough
simply to rely on the mean demand when determining policy.
The general basic model discussed here may be applied to two important
monopolistic industries, namely, postal services and fee-for-service roadways.
A number of factors influence the optimal determination of capacity and
price. In general, the illustrative example suggests the intuitive result that
Mathematical Optimization 33
References
Adie, D. 1989. Monopoly Mail. Piscataway, NJ: Transactions Publishers.
Boronico, J.S. 1996. Reliability-constrained capacity planning and pricing poli-
cies for toll facility operations. International Journal of Transport Economics
233: 98–122.
. 1997. Postal service pricing subject to reliability constraints on
service quality. Pricing Strategy and Practice: An International Journal, forth-
coming.
, M. Crew, and P.R. Kleindorfer. 1995. Postal service in the nineties.
In The Service and Productivity Challenge, edited by Patrick Harker, 471–492.
Boston, MA: Kluwer Academic Press.
, R.M. Kleyle, and A. De Korvin. 1996. An extension of Ramsey-
Boiteaux pricing to services offering limited deferability subject to reliability
constraints and fuzzy demand functions. Managerial Finance, forthcoming.
Cohen, R.H., W.W. Ferguson, and S.S. Xenakis. 1993. Rural delivery and the
universal service obligation: A quantitative investigation. In Crew and
Kleindorfer [1993], 161–176.
Colvin, J.L., D.B. Bradley, and M.A. Smith. 1993. Measuring product costs for
ratemaking: U.S. Postal Service. In Crew and Kleindorfer [1993], 133–158.
Crew, M.A., and P.R. Kleindorfer. 1986. The Economics of Public Utility Regula-
tion. Cambridge, MA: MIT Press.
34 The UMAP Journal 18.1 (1997)