Question: Question 1 0 / 2 points Why is unbounded a concern for linear optimization? Question options: The value to the solution may be infinitely large
| Question 1 | 0 / 2 points |
Why is unbounded a concern for linear optimization?
Question options:
| The value to the solution may be infinitely large | |
| The model cannot tell between a maximization or minimization problem | |
| No solution satisfies all constraints (including nonnegativity constraints) | |
| There are multiple solutions, challenging to pick one |
| Question 3 | 0 / 2 points |
If the labor hours used in an optimal feasible solution is 2,500 hours, then is this constraint binding or not binding if the labor hours available for producing both washing machines is less than or equal to 3,132?
Answer the following question with respect to the linear optimization matrix of constraints below.
Summary of production of washing machines
https://www.fm-magazine.com/issues/2019/feb/linear-programming-microsoft-excel.html
Question options:
| Not binding | |
| Binding |
| Question 4 | 0 / 2 points |
In the following Excel Solver dialogue box, what is the set objective?
https://www.fm-magazine.com/issues/2019/feb/linear-programming-microsoft-excel.html
Question options:
| The profit (in case of a profit maximization problem) or minimum cost (in the case of a minimum cost problem) | |
| The nonnegativity constraint | |
| The decision variables, that is, how much of each product to produce | |
| The constraints |
| Question 5 | 0 / 1 point |
If there is a positive value of slack for labor hours in the feasible optimal solution, what does this mean? Answer the following question with respect to the linear optimization matrix of constraints.
Summary of production of washing machines
https://www.fm-magazine.com/issues/2019/feb/linear-programming-microsoft-excel.html
Question options:
| The number of labor hours needed to product the two washing machines at the feasible optimal solution is greater than than the total number of labor hours available. | |
| If the right-hand side constraints increase by one, then profit will increase by $350. | |
| If the right-hand side constraints increase by one, then profit will increase by $300. | |
| The number of labor hours needed to product the two washing machines at the feasible optimal solution is less than the total number of labor hours available. |
| Question 6 | 0 / 1 point |
Why is infeasibility a concern for linear optimization?
Question options:
| There are multiple solutions, challenging to pick one | |
| The value to the solution may be infinitely large | |
| No solution satisfies all constraints (including nonnegativity constraints) | |
| The model cannot tell between a maximization or minimization problem |
| Question 7 | 0 / 1 point |
Which of the following is not a special case of linear optimization?
Question options:
| Sensitivity analysis | |
| Infeasible | |
| Alternative optimal solutions | |
| Unbounded |
| Question 8 | 0 / 1 point |
Which of the following is the least best solution you could present to the manager when you receive an infeasible solution for a profit maximum problem in linear optimization?
Question options:
| You could tell the manager how labor could be transferred from one department to another to help meet a certain constraint | |
| You could tell the manager a feasible solution will require lower production goals | |
| You could tell the manager how much more of a particular resource she needs | |
| You could tell the manager to change the prices of the two products produced |
| Question 10 | 0 / 2 points |
If this is a minimum cost optimization problem and you wanted to relax your availability of labor hours by adding one more labor hour, would total costs in the feasible solution increase or decrease?
Answer the following question with respect to the linear optimization matrix of constraints below.
Summary of production of washing machines
https://www.fm-magazine.com/issues/2019/feb/linear-programming-microsoft-excel.html
Question options:
| Increase | |
| Decrease | |
| Can't tell from the information provided |
| Question 11 | 0 / 1 point |
In linear optimization, nonbinding constraints have a shadow price of zero
Question options:
| True | |
| False |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
