(Cell B6)
Solving this problem results in p1 = $1,100 and p2 = $766.7 and a profit of $17,733,333 (Cell D7).
For the constrained case (see worksheet Constrained capacity), we set up an optimization
problem as shown in Equation 16.2:
Decision variables:
p1 = price that NatBike should charge customized segment (Cell B5)
p2 = price that NatBike should charge standard segment (Cell B6)
Objective:
Maximize profit : (p1 − 200)(20000 − 10 p1) + (p2 − 200)(40000 − 30 p2) (Cell D7)
Subject to:
(20000 − 10 p1) + (40000 − 30 p2) ≤ 20,000 (this will constrain total capacity used)
p1, p2 ≥ 0
Solving this problem using Solver (with GRG Nonlinear) results in p1 = $1,250 (Cell B5) and p2 =
$916.7 (Cell B6) and a profit of $16,833,333 (Cell D7). Observe that the capacity constraint
increases price charged to each segment.
7. Worksheet 16-7 presents the solution to this problem.
The only change that we make (relative to 16-6) here is with respect to the production costs as
shown in bold.
Unconstrained case (see worksheet Unconstrained capacity):
Using Equation 16.1 we obtain: