A computer company plans to sell two versions of a laptop (Laptop 1 and Laptop 2)

at a price of $295.00 and $450.00 with a cost (COGS) of $250.00 and $400.00.
Max Monthly Demand for Laptop 1 is 200 units.
Min Monthly Demand for Laptop 2 is 100 units.
Total COGS should not exceed $70,000.00.
What number of units produced and sold will maximize Contribution Margin?
(Contribution Margin = CM = Amount that can cover all none assigned costs and profit).
List Goal (Objective) , Variables (including Decision Variables), Objective function (formula to maximize) and constraints.
Solve on paper with Linear Algebra, then in Excel using Solver.

Formula Inputs Variables and Facts:

Computer Company

Contribution
Price COGS Margin

Written Constraints:
Max Monthly Demand for
Min Monthly Demand for
Max COGS for project

Goal (Objective):
Calculate the number of units for Laptop 1 and Laptop 2 which will maximize CM.

Objective Function: Formula

Total Contribution
Total Contribution Margin = TCM = $0* + $0* Margin

Math Constraints: Formula

x>= 0 non-negativity requirement
y>= 0 non-negativity requirement
<= Total Units for
>= Total Units for
$0* + $0* <= $0 Total COGS
y <= -2.5x+175
formula to maximize) and constraints.

# Units
Decision Variable = Produced
# Units Produced and Sold Product &Sold

Goal:

Maximize

Operator Constraint Slack

Total Contribution Margin
A computer company plans to sell two versions of a laptop (Laptop 1 and Laptop 2)
at a price of $295.00 and $450.00 with a cost (COGS) of $250.00 and $400.00.
Max Monthly Demand for Laptop 1 is 200 units.
Min Monthly Demand for Laptop 2 is 100 units.
Total COGS should not exceed $70,000.00.
What number of units produced and sold will maximize Contribution Margin?
(Contribution Margin = CM = Amount that can cover all none assigned costs and profit).
List Goal (Objective) , Variables (including Decision Variables), Objective function (formula to maximize) and constraints.
Solve on paper with Linear Algebra, then in Excel using Solver.

Formula Inputs Variables and Facts:

Computer Company

Contribution
Price COGS Margin
$295.00 $250.00 $45.00
$450.00 $400.00 $50.00

Written Constraints:
Max Monthly Demand for Laptop 1 200
Min Monthly Demand for Laptop 2 100
Max COGS for project $70,000.00

Goal (Objective):
Calculate the number of units for Laptop 1 and Laptop 2 which will maximize CM.

Objective Function: Formula

Total Contribution
= TCM = $45*x = $50*y Margin $10,400.00

Math Constraints: Formula

x>= 0 non-negativity requirement
y>= 0 non-negativity requirement
x <= 200 Total Units for x 120
y >= 100 Total Units for y 100
$250*x + $400*y <= $70,000 Total COGS $70,000.00
y <= -2.5x+175
=F15
=F16
=SUMPRODUCT(B15:B16,F15:F16)
sts and profit).
unction (formula to maximize) and constraints.

Decision Variable = # Units Produced

# Units Produced and Sold Product &Sold
x Laptop 1 120 =A15-B15
y Laptop 2 100 =A16-B16

Goal:

Maximize =SUMPRODUCT(C15:C16,F15:F16)

Operator Constraint Slack

<= 200 80
>= 100 0
<= $70,000.00 0

=E32-C32
=E33-C33
MPRODUCT(B15:B16,F15:F16) =E34-C34
Alternative Optimal Solutions: More than one Optimal Solution for Manager to Choose From: O
16
14
12
10
8

nitsy
6

U
4
2
0
-2 0 2 4 6
-2
Uni

Alternative Optimal Solutions: More than one Optimal Solution for Manager to Choose Fro
16
14
12
10
8
itsy

6
n
U

4
2
0
-2 0 2 4
-2

Alternative Optimal Solutions: More than one Optimal Solution for Manager to Choose Fro
16
14
12
10
8
y
Alternative Optimal Solutions: More than one Optimal Solution for Manager to Choose Fro
16
14
12
10
8

itsy
6

n
U
4
2
0
-2 0 2 4
-2
 x>= 0
x y
0 0
0 280

y>= 0
350
x y

Laptop 2 = y = # Units Produced &Sold

0 0 300
300 0
250

x <= 200 200 Max CM =

x y x>= 0
200 0 150 y>= 0
x <= 200
100 y >= 100
200 300 y <= -2.5x
50
y >= 100
0
x y 0 50 100 150 200 250 300 350
0 100 Laptop 1 = x = # Units Produced &Sold
300 100

y <= -2.5x+175
x y
0 175
280 0

Unit Chart Label:

Optimal Objective Function Contour Line = $45*x$50*y

Laptop 1 = 120
350
Laptop 2 = y = # Units Produced &Sold

Laptop
Laptop 2
1 == 100
120 and
Laptop 2 = 100 300
Laptop 1 = x = # Units Produced &Sold 250
Laptop 2 = y = # Units Produced &Sold
200

Max CM = $10,400 150

x y Optimal 100
120 100 10400
50
0 $208.00 10400
$231.11 0 10400 0
0 50 100 150 200 250 300 350
Laptop 1 = x = # Units Produced &Sold
$45*x$50*y = $10,400
Optimal Objective Function Contour Line = $45*x$50*y = $10,400
ons: More than one Optimal Solution for Manager to Choose From: Optimal Objective Function Contour Line Coincides with a Binding Constraint Line on Boundary of Feasible Region Alternative Optimal Solutions: More than one Op
16
14
12 y <= -2*x + 14
10
b1 b0
y <= -2*x + 14 -2 14
8 y <= -1/2*x + 6 x y
nitsy

6 y <= -1*x + 8
0 14
U

4 $2*y = $2*x = $16

7 0
2
0 y <= -1/2*x + 6
-2 0 2 4 6 8 10 12 14
-2 b1 b0
Units x -0.5 6
x y
0 6
12 0
olutions: More than one Optimal Solution for Manager to Choose From: Optimal Objective Function Contour Line Coincides with a Binding Constraint Line on Boundary of Feasible Region
16
y <= -1*x + 8
14 b1 b0
12 -1 8
10 x y
y <= -2*x + 14
8 y <= -1/2*x + 6 0 8
itsy

6 y <= -1*x + 8 8 0
n
U

4 $2*y = $2*x = $16

2 y = -1*x + 8 $2*y = $2*x = $16

0 b1 b0 y
-2 0 2 4 6 8 10 12 14 -1 8 1
-2
x y
Units x
0 8
8 0
-1 9
olutions: More than one Optimal Solution for Manager to Choose From: Optimal Objective Function Contour Line Coincides with a Binding Constraint Line on Boundary of Feasible Region
9 -1
16
14
12
10 y <= -2*x + 14
8 y <= -1/2*x + 6
y
olutions: More than one Optimal Solution for Manager to Choose From: Optimal Objective Function Contour Line Coincides with a Binding Constraint Line on Boundary of Feasible Region
16
14
12 Multiple Solutions
10 y <= -2*x + 14 x y
8 y <= -1/2*x + 6 4 4
y <= -1*x + 8
itsy

6 6 2
n

$2*y = $2*x = $16

U

4 Multiple Solutions
2
0
-2 0 2 4 6 8 10 12 14
-2
Units x
 x>= 0 Infeasibility
x y No Intersection of all equations
0 0 Infeasibility: No Intersection of
0 280

y>= 0
x y
Infeasibility: No Intersection o
0 0
350
300 0

Laptop 2 = y = # Units Produced &Sold

300

Max CM = $10,400 x <= 300 250

x>= 0 x y
200
y>= 0 300 0
x <= 200 150
y >= 100
y <= -2.5x+175 300 300 100

50
y >= 225
0
300 350 x y 0 100 200 3
d 0 225 Laptop 1 = x = # Uni
500 225

y <= -2.5x+175
x y
0 175
280 0

Unit Chart Label:

on Contour Line = $45*x$50*y = $10,400

=
== and
=
Max CM = $10,400 = = # Units Produced &Sold
x>= 0 = = # Units Produced &Sold
y>= 0
x <= 200
Max CM = $0
y >= 100
y <= -2.5x+175 x y
$45*x$50*y = $10,400 0 0

00 250 300 350

Produced &Sold
utions: More than one Optimal Solution for Manager to Choose From: Optimal Objective Function Contour Line Coincides with a Binding C

Alternative Optimal Solutions: More than one Optimal Solution for Manager to Choose From: Optimal Objective Function Contour Line Coincides with a Binding Constraint Line on Boundary of Feasible Region
16
14
12
10
8 y <= -1/2*x + 6
itsy

y <= -2*x + 14
n

6
U

4
2
0
0 2 4 6 8 10 12 14
Units x

$2*y = $2*x = $16

y <= -1*x + 8 y = -1*x + $2*y = $2*x = $16
b1 b0 b1 b0 y
-1 8 -1 8 1
x y x y
0 8 0 8
8 0 8 0
-1 9
9 -1
 Infeasibility
No Intersection of all equations to create Feasible Region
Infeasibility: No Intersection of all equations to create Feasible Region

nfeasibility: No Intersection of all equations to create Feasible Region

350
Laptop 2 = y = # Units Produced &Sold

300

250
x>= 0
200 y>= 0
x <= 300
150
y >= 225
100 y <= -2.5x+175

50

0
0 100 200 300 400 500 600
Laptop 1 = x = # Units Produced &Sold

350
Laptop 2 = y = # Units Produced &Sold

300

250

200

150

100

50

0
0 50 100 150 200 250 300 350
Laptop 1 = x = # Units Produced &Sold
r Line Coincides with a Binding Constraint Line on Boundary of Feasible Region
 x>= 0 Unbound
x y The value of the solution can continue changing without hitting a constraint.
0 0 Unbound: The value of the solution can continue changing without hitting a constraint.
0 280

y>= 0
x y
Unbound: The value of the solution can continue changing without hitting a constraint.
0 0
300
300 0
250
x <= 300

Laptop2 =y =#Units Produced&Sold

200
x y
x>= 0
300 0 150 y <= 225
y >= -2.5x+175
100
300 300
50
y <= 225
0
x y 0 100 200 300 400 500 600
0 225 Laptop 1 = x = # Units Produced &Sold
500 225

y >= -2.5x+175
x y
0 175
350
280 0
Laptop 2 = y = # Units Produced &Sold

300
Unit Chart Label:
250

= 200
== and
150
=
= = # Units Produced &Sold 100
= = # Units Produced &Sold
50

Max CM = $0 0
x y 0 50 100 150 200 250 300 350

0 0 Laptop 1 = x = # Units Produced &Sold

g a constraint.
hout hitting a constraint.

ng a constraint.

175

00 250 300 350

duced &Sold
Microsoft Excel 15.0 Answer Report
Worksheet: [BI348-Chapter08.xlsx]Manufacturing Max
Report Created: 12/11/2015 4:11:57 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 3 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)

Cell Name Original Value Final Value
$C$27 Total Contribution Margin Formula $95.00 $10,400.00

Variable Cells
Cell Name Original Value Final Value Integer
$F$15 Laptop 1 # Units Produced &Sold 1 120 Contin
$F$16 Laptop 2 # Units Produced &Sold 1 100 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$C$32 Total Units for X Formula 120 $C$32<=$E$32 Not Binding 80
$C$33 Total Units for Y Formula 100 $C$33>=$E$33 Binding 0
$C$34 Total COGS Formula $70,000.00 $C$34<=$E$34 Binding 0
Microsoft Excel 15.0 Sensitivity Report
Worksheet: [BI348-Chapter08.xlsx]Manufacturing Max
Report Created: 12/11/2015 4:11:57 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$F$15 Laptop 1 # Units Produced &Sold 120 0 45 1E+030 13.75
$F$16 Laptop 2 # Units Produced &Sold 100 0 50 22 1E+030

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$C$32 Total Units for X Formula 120 0 200 1E+030 80
$C$33 Total Units for Y Formula 100 -22 100 75 50
$C$34 Total COGS Formula $70,000.00 0.18 70000 20000 30000
Decision Variable: # Units Shipped
Orgin ( r) / Coeur
Destination (c ) Spokane Las Vegas d'Alene Rapid City
Oakland X11 X12 X13 X14
Portland X21 X22 X23 X24
Seattle X31 X32 X33 X34

Decision Variable: # Units Shipped

Orgin ( r) / Coeur
Destination (c ) Spokane Las Vegas d'Alene Rapid City Total
Oakland 950 4125 0 0 5075 <=
Portland 2475 0 2050 1625 6150 <=
Seattle 2725 0 0 0 2725 <=
Total 6150 4125 2050 1625 13950

= = = =
Demand 6150 4125 2050 1625 Total Costs

Coeur
Shipping Cost per Unit Spokane Las Vegas d'Alene Rapid City
Oakland 3.5 2.5 6.75 7
Portland 6 5.5 2.25 3.25
Seattle 2.5 5 3.75 5.25
Supply Constraints
5075
6150
2725

Objective Function
45193.75
Goal: Min
The maximum available funds for a portfolio of investments are $250,000.
The three investment categories for this portfolio are: Tech Sector, Retail Sector and Corporate Bonds Index Fund.
The individual investments being considered are MSFT, AAPL, TGT, AMZN, E*Trade Corp Bond Fund.
The expected returns on the investments are as follows: MSFT = 6.50%, AAPL = 11.50%, TGT = 5.90%, AMZN = 8.50%, E*Trade
The maximum amount to invest in the Tech Sector is $125,000.
The minimum amount to invest in the Retail Sector is $75,000.
The minimum amount to invest in the the individual stock TGT is $15,000.
The minimum amount to invest in Corporate Bonds Index Fund is 20% of the amount invested in the Tech Sector.
What is the amount should be invested in each investment so that profits are maximized?

Goal:
Maximize: Returns for Portfolio

List Variables and Facts:

Amount Invested Amount Invested
Decision Variable x1
Decision Variable x2
Decision Variable x3
Decision Variable x4
Decision Variable x5

Constraints:
Available Funds
Max amount to invest in Tech Sector =
Min amount to invest in Retail Sector =
Min amount to invest in TGT =
$ 250,000.00
$ 125,000.00
$ 75,000.00
$ 15,000.00

Min amount to invest in Corporate Bonds Index

Fund = 0.2* Amount Invested in Tech Sector 0.2
Each Amount must be non-negative 0

Objective Function:
= x1 * 0.065 + x2 * 0.115 + x3 * 0.059 + x4 * 0.085 + x5 * 0.055
Constraints:
x1 + x2 + x3 + x4 + x5 <= $250,000.00 Total Invested
x1 + x2 <= $125,000.00 Total Invested in Tech Sector
x3 + x4 >= $75,000.00 Total Invested in Retail Sector
x3 >= $15,000.00 Total Invested in TGT
x5 >= (x1 + x2)*0.2 Total Invested in Corporate Bonds Index Fund
te Bonds Index Fund.

= 5.90%, AMZN = 8.50%, E*Trade Corp Bond Fund = 5.50%.

d in the Tech Sector.

Investment Expected Returns Amount Invested

MSFT 0.065 $ 1,000.00 Tech Sector
AAPL 0.115 $ 1,000.00
TGT 0.059 $ 1,000.00 Retail Sector
AMZN 0.085 $ 1,000.00
E*Trade Corp Bond Fund 0.055 $ 1,000.00 Corporate Bonds Index Fund

Formula Goal:
Maximize
Formula Operator Constraint Slack
<=
<=
>=
>=
>=

0.2*Amount
Invested in Tech
Sector
Excel Formulas:
The maximum available funds for a portfolio of investments are $250,000.
The three investment categories for this portfolio are: Tech Sector, Retail Sector and Corporate Bonds Index Fund.
The individual investments being considered are MSFT, AAPL, TGT, AMZN, E*Trade Corp Bond Fund.
The expected returns on the investments are as follows: MSFT = 6.50%, AAPL = 11.50%, TGT = 5.90%, AMZN = 8.50%, E*Trade
The maximum amount to invest in the Tech Sector is $125,000.
The minimum amount to invest in the Retail Sector is $75,000.
The minimum amount to invest in the the individual stock TGT is $15,000.
The minimum amount to invest in Corporate Bonds Index Fund is 20% of the amount invested in the Tech Sector.
What is the amount should be invested in each investment so that profits are maximized?

Goal:
Maximize: Returns for Portfolio

List Variables and Facts:

Amount Invested Amount Invested
Decision Variable x1
Decision Variable x2
Decision Variable x3
Decision Variable x4
Decision Variable x5

Constraints:
Available Funds
Max amount to invest in Tech Sector =
Min amount to invest in Retail Sector =
Min amount to invest in TGT =
$ 250,000.00
$ 125,000.00
$ 75,000.00
$ 15,000.00

Min amount to invest in Corporate Bonds Index

Fund = 0.2* Amount Invested in Tech Sector 0.2
Each Amount must be non-negative 0

Objective Function:
= x1 * 0.065 + x2 * 0.115 + x3 * 0.059 + x4 * 0.085 + x5 * 0.055
Constraints:
x1 + x2 + x3 + x4 + x5 <= $250,000.00 Total Invested
x1 + x2 <= $125,000.00 Total Invested in Tech Sector
x3 + x4 >= $75,000.00 Total Invested in Retail Sector
x3 >= $15,000.00 Total Invested in TGT
x5 >= (x1 + x2)*0.2 Total Invested in Corporate Bonds Index Fund
te Bonds Index Fund.

= 5.90%, AMZN = 8.50%, E*Trade Corp Bond Fund = 5.50%.

d in the Tech Sector.

Investment Expected Returns Amount Invested

MSFT 0.065 $ - Tech Sector
AAPL 0.115 $ 125,000.00
TGT 0.059 $ 15,000.00 Retail Sector
AMZN 0.085 $ 85,000.00
E*Trade Corp Bond Fund 0.055 $ 25,000.00 Corporate Bonds Index Fund

Formula Goal:
$ 23,860.00 Maximize
Formula Operator Constraint Slack
$ 250,000.00 <= $ 250,000.00
$ 125,000.00 <= $ 125,000.00
$ 100,000.00 >= $ 75,000.00
$ 15,000.00 >= $ 15,000.00
$ 25,000.00 >= $ 25,000.00

0.2*Amount
Invested in Tech
Sector
Excel Formulas:
=SUMPRODUCT(D17:D21,E17:E21)
=SUM(E17:E21) =B23
=SUM(E17:E18) =B24
=SUM(E19:E20) =B25
=E19 =B26
=E21 =C34*B27
Decision Variable: # Units Shipped
Orgin ( r) / Coeur
Destination (c ) Spokane Las Vegas d'Alene Rapid City
Oakland X11 X12 X13 X14
Portland X21 X22 X23 X24
Seattle X31 X32 X33 X34

Decision Variable: # Units Shipped

Orgin ( r) / Coeur
Destination (c ) Spokane Las Vegas d'Alene Rapid City Totals
Oakland 1000 4000 0 0 5000 <=
Portland 2500 0 2000 1500 6000 <=
Seattle 2500 0 0 0 2500 <=
Totals 6000 4000 2000 1500 13500
= = = =
Demand Constraint 6,000 4,000 2,000 1,500 Objective Function:
39500
Coeur
Cost per Unit Spokane Las Vegas d'Alene Rapid City
Oakland 3 2 7 6
Portland 6 5 2 3
Seattle 2 5 4 5

Alternative Solutions:
New Max Objective Function = Sum of Decision Variables that are equal to zero.

New Constraint:
Constraint
Function Operator Limit
 Supply Constraint
5,000
6,000
2,500

Objective Function:
Goal: Minimize Costs
Decision Variable: # Units Shipped
Orgin ( r) / Coeur
Destination (c ) Spokane Las Vegas d'Alene Rapid City
Oakland X11 X12 X13 X14
Portland X21 X22 X23 X24
Seattle X31 X32 X33 X34

Decision Variable: # Units Shipped

Orgin ( r) / Coeur
Destination (c ) Spokane Las Vegas d'Alene Rapid City Totals
Oakland 3500 1500 0 0 5000 <=
Portland 0 2500 2000 1500 6000 <=
Seattle 2500 0 0 0 2500 <=
Totals 6000 4000 2000 1500 13500
= = = =
Demand Constraint 6,000 4,000 2,000 1,500 Objective Function:
39500
Coeur
Cost per Unit Spokane Las Vegas d'Alene Rapid City
Oakland 3 2 7 6
Portland 6 5 2 3
Seattle 2 5 4 5

Alternative Solutions:
New Max Objective Function = Sum of Decision Variables that are equal to zero.
2500 Objective: Max =SUM(C11:E11,C10,D9:E9)
New Constraint:
Constraint
Function Operator Limit
39500 = 39500

=G15
1000 4000 0 0
2500 0 2000 1500
2500 0 0 0
 Supply Constraint
5,000
6,000
2,500

Objective Function:
Goal: Minimize Costs
Gel Boomerangs: Manufacturer try to decide between 4 Projects and has limited resources over next four years
Binary Example When There Is Limited Capital
Binary Variable is like on on/off switch.

New CC Router New Paint Room

Machine New Delivery Van Research Project Equipment
Year Cash Flow Cash Flow Cash Flow Cash Flow
0 -$254,000 -$50,000 -$3,500 -$90,150
1 $135,000 $49,500 $15,000 $125,000
2 $130,000 $22,500 $6,000 $19,000
3 $130,000 $59,500 $1,000 $17,500
4 $125,000 -$5,000 -$4,000 -$6,500
Discount Rate 0.175 0.15 0.22 0.175
Net Present Value $85,760 $40,278 $9,485 $31,806
Binary (1 or 0) Variable
TRUE = 1, FALSE = 0

Year Capital Req. Capital Req. Capital Req. Capital Req.

Year 1 $15,000 $10,000 $2,000 $15,000
Year 2 $10,000 $5,000 $2,000
Year 3 $17,000 $5,000 $2,000
Year 4 $19,000 $15,000 $1,000 $25,000

Excel Formulas:
=NPV(B14,B8:B12) =NPV(C14,C8:C12) =NPV(D14,D8:D12) =NPV(E14,E8:E12)
next four years

Total NPV Goal: Math Formula:

Maximize 85760* + 40278* + 9485* + 31806*

Capital
Total Operator Available Math Constraint:
<= $40,000 15000* + 10000* + 2000* + 15000* <= 40000
<= $50,000 10000* + 5000* + 2000* + * <= 50000
<= $40,000 17000* + 5000* + 2000* + * <= 40000
<= $35,000 19000* + 15000* + 1000* + 25000* <= 35000
Gel Boomerangs: Manufacturer try to decide between 4 Projects and has limited resources over next four years
Binary Example When There Is Limited Capital
Binary Variable is like on on/off switch.

New CC Router New Paint Room

Machine New Delivery Van Research Project Equipment
Year Cash Flow Cash Flow Cash Flow Cash Flow
0 -$254,000 -$50,000 -$3,500 -$90,150
1 $135,000 $49,500 $15,000 $125,000
2 $130,000 $22,500 $6,000 $19,000
3 $130,000 $59,500 $1,000 $17,500
4 $125,000 -$5,000 -$4,000 -$6,500
Discount Rate 0.175 0.15 0.22 0.175
Net Present Value $85,760 $40,278 $9,485 $31,806
Binary (1 or 0) Variable C V R P
TRUE = 1, FALSE = 0 1 1 1 0

Year Capital Req. Capital Req. Capital Req. Capital Req.

Year 1 $15,000 $10,000 $2,000 $15,000
Year 2 $10,000 $5,000 $2,000
Year 3 $17,000 $5,000 $2,000
Year 4 $19,000 $15,000 $1,000 $25,000

Excel Formulas:
=NPV(B14,B8:B12) =NPV(C14,C8:C12) =NPV(D14,D8:D12) =NPV(E14,E8:E12)
next four years

Total NPV Goal: Math Formula:

$135,523 Maximize 85760*C + 40278*V + 9485*R + 31806*P

Capital
Total Operator Available Math Constraint:
$27,000 <= $40,000 15000*C + 10000*V + 2000*R + 15000*P <= 40000
$17,000 <= $50,000 10000*C + 5000*V + 2000*R + *P <= 50000
$24,000 <= $40,000 17000*C + 5000*V + 2000*R + *P <= 40000
$35,000 <= $35,000 19000*C + 15000*V + 1000*R + 25000*P <= 35000

=SUMPRODUCT(B15:E15,B17:E17)

=SUMPRODUCT(B20:E20,$B$17:$E$17)
=SUMPRODUCT(B21:E21,$B$17:$E$17)
=SUMPRODUCT(B22:E22,$B$17:$E$17)
=SUMPRODUCT(B23:E23,$B$17:$E$17)