ch8
1. Linear programming assumes that the profit from each activity is proportional to the level of that
activity.
True False
2. If the slope of a graph never increases but sometimes decreases as the level of the activity increases, then
it is said to have decreasing marginal returns.
True False
3. In problems where the objective is to minimize the total cost of the activities, an activity is said to have
decreasing marginal returns if the slope of its cost graph never increases but sometimes decreases as the
level of the activity increases.
True False
4. If C1:C6 are all changing cells, then SUMPRODUCT(C1:C3, C4:C6) is a linear function.
True False
5. If C1 is a changing cell, then ROUND(C1) is a linear function.
True False
6. If D1 is a data cell, and C1 and C2 are changing cells, then IF(D1 >= 2, C1, C2) is a linear function.
True False
7. Nonlinear programming problems with decreasing marginal returns are generally easier to solve then
nonlinear programming problems with increasing marginal returns.
True False
8. Sometimes the Solver can return different solutions when optimizing a nonlinear programming
problem.
True False
9. Excel's curve fitting method is used to graph a nonlinear equation.
True False
10. Excel's curve fitting method is used to find the values of the parameters for an equation that best fit
data.
True False
11. A local maximum is always a global maximum in a nonlinear programming problem.
True False
12. A quadratic programming problem is a special type of linear programming problem.
True False
13. Having activities with decreasing marginal returns is the only way that the proportionality assumption can
be violated.
True False
14. Separable programming is applicable when there are increasing or decreasing marginal returns.
True False
15. In separable programming, each activity that violates the proportionality assumption is separated into
parts with a new variable for each part.
True False
16. In some cases of separable programming, the profit graphs will be curves rather than a series of line
segments.
True False
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 20:58:54 GMT -06:00
https://www.coursehero.com/file/10446464/ch8/
, 17. When the marginal return from an activity decreases on a continuous basis, the profit graphs will consist
of a series of line segments.
True False
18. Applying separable programming requires having profit graphs that are smooth curves.
True False
19. A nonlinear function may contain a product of two variables.
True False
20. In separable programming, if an activity violates the proportionality assumption it must have increasing
marginal returns.
True False
21. Profit = 3x1 + 2x2 + 9x1x2 is an example of a nonlinear function.
True False
22. The additivity assumption of linear programming states that each term in the objective function is the sum
of two or more variables.
True False
23. The additivity assumption can be violated by nonlinear programming because of cross-product terms
involving the product of two variables.
True False
24. It now is common practice for professional managers of large stock portfolios to use computer models
based partially on separable programming.
True False
25. When applying nonlinear programming to portfolio selection, a trade-off is being made between the
expected return and the risk associated with the investment.
True False
26. The risk for a portfolio is decreased when the particular stocks tend to move up and down together.
True False
27. Solver Table can be used for nonlinear programming problems to systematically try a number of different
starting points.
True False
28. Trying different starting points and picking the best solution will always yield the optimal solution to a
nonlinear programming problem.
True False
29. Evolutionary Solver uses an algorithm based on genetics, evolution, and survival of the fittest.
True False
30. Mutation is the technique used to create the next generation of solutions in the Evolutionary Solver.
True False
31. The standard Solver keeps track of a large set of candidate solutions, called the population.
True False
32. The members of the population used to create the next generation are picked randomly by the
Evolutionary Solver.
True False
33. Sometimes Evolutionary Solver will make a random change in a member of the population.
True False
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 20:58:54 GMT -06:00
https://www.coursehero.com/file/10446464/ch8/
1. Linear programming assumes that the profit from each activity is proportional to the level of that
activity.
True False
2. If the slope of a graph never increases but sometimes decreases as the level of the activity increases, then
it is said to have decreasing marginal returns.
True False
3. In problems where the objective is to minimize the total cost of the activities, an activity is said to have
decreasing marginal returns if the slope of its cost graph never increases but sometimes decreases as the
level of the activity increases.
True False
4. If C1:C6 are all changing cells, then SUMPRODUCT(C1:C3, C4:C6) is a linear function.
True False
5. If C1 is a changing cell, then ROUND(C1) is a linear function.
True False
6. If D1 is a data cell, and C1 and C2 are changing cells, then IF(D1 >= 2, C1, C2) is a linear function.
True False
7. Nonlinear programming problems with decreasing marginal returns are generally easier to solve then
nonlinear programming problems with increasing marginal returns.
True False
8. Sometimes the Solver can return different solutions when optimizing a nonlinear programming
problem.
True False
9. Excel's curve fitting method is used to graph a nonlinear equation.
True False
10. Excel's curve fitting method is used to find the values of the parameters for an equation that best fit
data.
True False
11. A local maximum is always a global maximum in a nonlinear programming problem.
True False
12. A quadratic programming problem is a special type of linear programming problem.
True False
13. Having activities with decreasing marginal returns is the only way that the proportionality assumption can
be violated.
True False
14. Separable programming is applicable when there are increasing or decreasing marginal returns.
True False
15. In separable programming, each activity that violates the proportionality assumption is separated into
parts with a new variable for each part.
True False
16. In some cases of separable programming, the profit graphs will be curves rather than a series of line
segments.
True False
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 20:58:54 GMT -06:00
https://www.coursehero.com/file/10446464/ch8/
, 17. When the marginal return from an activity decreases on a continuous basis, the profit graphs will consist
of a series of line segments.
True False
18. Applying separable programming requires having profit graphs that are smooth curves.
True False
19. A nonlinear function may contain a product of two variables.
True False
20. In separable programming, if an activity violates the proportionality assumption it must have increasing
marginal returns.
True False
21. Profit = 3x1 + 2x2 + 9x1x2 is an example of a nonlinear function.
True False
22. The additivity assumption of linear programming states that each term in the objective function is the sum
of two or more variables.
True False
23. The additivity assumption can be violated by nonlinear programming because of cross-product terms
involving the product of two variables.
True False
24. It now is common practice for professional managers of large stock portfolios to use computer models
based partially on separable programming.
True False
25. When applying nonlinear programming to portfolio selection, a trade-off is being made between the
expected return and the risk associated with the investment.
True False
26. The risk for a portfolio is decreased when the particular stocks tend to move up and down together.
True False
27. Solver Table can be used for nonlinear programming problems to systematically try a number of different
starting points.
True False
28. Trying different starting points and picking the best solution will always yield the optimal solution to a
nonlinear programming problem.
True False
29. Evolutionary Solver uses an algorithm based on genetics, evolution, and survival of the fittest.
True False
30. Mutation is the technique used to create the next generation of solutions in the Evolutionary Solver.
True False
31. The standard Solver keeps track of a large set of candidate solutions, called the population.
True False
32. The members of the population used to create the next generation are picked randomly by the
Evolutionary Solver.
True False
33. Sometimes Evolutionary Solver will make a random change in a member of the population.
True False
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 20:58:54 GMT -06:00
https://www.coursehero.com/file/10446464/ch8/
