MyEducator Tasks

$2\mathrm{.}1$ Set up solver to determine how many of each type of candy bar to make to maximize total profit subject to the following constraints:

a$.$ The number of candy bars made should not exceed the demand for that type of candy bar.

b$.$ You must make at least $1$ million of each type of candy bar. Do not use commas when entering the number into the Solver constraint.

c$.$ The ingredients consumed in making the candy bars should not exceed what is available.

d$.$ There is a national nut shortage and they are expensive. To avoid nuts spoiling, you must use all of the nuts.

e$.$ Make only whole number amounts of candy bars.

f$.$ Before solving make the solving method "Simplex LP$"$ and checkmark the "Make

Solver Parameters

Set Objective:

To: Max Min

By Changing Variable Cells:

SCS$8$:SE$$8$

Make Unconstrained Variables Non$-$Negative

Select a Solving Method: $$

Simplex LP $$ Options

Solving Method

Select the GRG Nonlinear engine for Solver Problems that are smooth nonlinear. Select the LP Simplex engine for linear Solver Problems, and select the Evolutionary engine for Solver problems that are non$-$smooth.

Help

MyEducator Tasks

$3\mathrm{.}1$ Set up solver to determine how many of each type of candy bar to make to maximize total profit subject to the following constraints:

a$.$ The number of candy bars made should not exceed the demand for that type of candy bar.

b$.$ You must make at least $1$ million of each type of candy bar. Do not use commas when entering the number into the Solver constraint.

c$.$ The ingredients consumed in making the candy bars shoutd not exceed what is available.

d$.$ There is a national nut shortage and they are expensive. To avoid nuts spoiling, you must use all of the nuts.

e$.$ Make only whole number amounts of candy bars.

f$.$ Before solving make the solving method "Simplex LP$"$

Solver Parameters

Set Objective:

To: Max Min

By Changing Variable Cells:

SCS$8$:SE$$8$

Make Unconstrained Variables Non$-$Negative

Select a Solving Method: $$

Simplex LP $$ Options

Solving Method

Select the GRG Nonlinear engine for Solver Problems that are smooth nonlinear. Select the LP Simplex engine for linear Solver Problems, and select the Evolutionary engine for Solver problems that are non$-$smooth.

Help

MyEducator Tasks

$3\mathrm{.}1$ Set up solver to determine how many of each type of candy bar to make to maximize total profit subject to the following constraints:

a$.$ The number of candy bars made should not exceed the demand for that type of candy bar.

b$.$ You must make at least $1$ million of each type of candy bar. Do not use commas when entering the number into the Solver constraint.

c$.$ The ingredients consumed in making the candy bars shoutd not exceed what is available.

d$.$ There is a national nut shortage and they are expensive. To avoid nuts spoiling, you must use all of the nuts.

e$.$ Make only whole number amounts of candy bars.