Microsoft Excel 16.

32 Answer Report
Worksheet: [Linear Optimization Practice 4.xlsx]3.6
Report Created: 12/08/2020 5:21:32 PM
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 40126683.588 Seconds.
Iterations: 1 Subproblems: 2
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
$B$14 Total profit Product 1 2900 2900

Variable Cells
Cell Name Original Value Final Value Integer
$B$12 units Product 1 26 26 Integer
$C$12 units Product 2 55 55 Integer
$D$12 units Product 3 20 20 Integer

Constraints
Cell Name Cell Value Formula Status Slack
$B$18 Milling actual 499 $B$18<=$C$18 Not Binding 1
$B$19 Lathe actual 350 $B$19<=$C$19 Binding 0
$B$20 Grinder actual 118 $B$20<=$C$20 Not Binding 32
$B$22 Product 3 actual 20 $B$22=$C$22 Binding 0
$B$12:$D$12=Integer
NonNegative
Parameters
Machine hours required
Machine Type Product 1 Product 2 Product 3 Available hours
Milling 9 3 5 500
Lathe 5 4 0 350
Grinder 3 0 2 150
unit profit 50 20 25
Demand over prod. over prod. 20

Model
Product 1 Product 2 Product 3
units 26 55 20

Total profit 2900

Constraints
actual available hrs
Milling 499 500
Lathe 350 350
Grinder 118 150
actual Demand
Product 3 20 20

A. The production of product 1,2 and 3 is the required activity.

The limited resources are the available hours per week of the
miling, grinder and lathe machines.

B. it is how many units should be produced for each product to

mximize the profit.

C. The Constraints is in the quantitative expressions

Constraints
available hrs
Milling 500
Lathe 350
Grinder 150
Demand
Product 3 20
E. Let A = be the # of PRODUCT 1 to produce
Let B = be the # of PRODUCT 2 to produce
Let C = be the # of PRODUCT 3 to produce
Maximize Profit= 50A + 20B + 25C
A.
Microsoft Excel 16.32 Answer Report
Worksheet: [Linear Optimization Practice 4.xlsx]3.16
Report Created: 12/08/2020 5:31:28 PM
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 44851232.611 Seconds.
Iterations: 6 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 1E-06, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)

Cell Name Original Value Final Value
$B$14 total cost Customer 1 0 540000

Variable Cells
Cell Name Original Value Final Value Integer
$B$11 Factory 1 Customer 1 0 0 Integer
$C$11 Factory 1 Customer 2 0 200 Integer
$D$11 Factory 1 Customer 3 0 200 Integer
$B$12 Factory 2 Customer 1 0 300 Integer
$C$12 Factory 2 Customer 2 0 0 Integer
$D$12 Factory 2 Customer 3 0 200 Integer

Constraints
Cell Name Cell Value Formula Status Slack
$B$18 Factory 1 actual 400 $B$18<=$C$18 Binding 0
$B$19 Factory 2 actual 500 $B$19<=$C$19 Binding 0
$B$21 Customer 1 actual 300 $B$21=$C$21 Binding 0
$B$22 Customer 2 actual 200 $B$22=$C$22 Binding 0
$B$23 Customer 3 actual 400 $B$23=$C$23 Binding 0
$B$11:$D$12=Integer
me NonNegative
Parameters
Cost per unit
from/to Customer 1 Customer 2 Customer 3 Output
Factory 1 600 800 700 400
Factory 2 400 900 600 500
Order size 300 200 400

Model
units to be shipped
Customer 1 Customer 2 Customer 3
Factory 1 0 200 200
Factory 2 300 0 200

total cost 540000

Constraints
actual available
Factory 1 400 400
Factory 2 500 500
actual order size
Customer 1 300 300
Customer 2 200 200
Customer 3 400 400

Algebraic form
let:
a=factory 1
b=factory 2
x=customer 1
y=customer 2
z=customer 3
t=total cost
ax+ay+az+bx+by+bz=t