11. A diet planning problem can be solved using linear programming to: A) Maximize the cost of the diet B) Minimize the variety of foods C) Minimize the cost while meeting nutritional requirements D) Maximize calorie intake 12. Linear programming can help a manufacturing company: A) Predict future sales B) Maximize profit given production constraints C) Improve employee morale D) Develop new products 13. A transportation company can utilize linear programming to: A) Minimize the cost of delivering goods. B) Increase fuel consumption. C) Avoid environmental regulations. D) Maximize delivery time. 14. What does it mean if a linear programming problem is unbounded? A) The objective function can increase or decrease infinitely without violating constraints. B) The problem has no feasible solution. C) The problem has a unique optimal solution. D) The problem is degenerate. 15. What does it mean if a linear programing problem is infeasible? A) The objective function can increase or decrease infinitely without violating constraints. B) The problem has no feasible solution. C) The problem has a unique optimal solution. D) The problem is degenerate. 16. Which condition is most important for linear programming? A) Decision variables C) Constraints B) Objective function D) Linearity 17. Which statement is false in linear programming? A) Optimal solution will occur at the corner point. B) At least two corner points are optimal if there are multiple optimal solutions. C) Every decision variable should have a constraint. D) Decision variables should have a non-negativity 18. The two primary types of optimization problems in LP are: A) Minimization and Equality C) Maximization and Minimization B) Maximization and Inequality D) Equality and Inequality 19. Which of the following is a technique for optimizing a linear objective function subject to linear constraint? A). Dynamic Programming C) Linear Programming B) Linear Regression D) Network Analysis 20. The optimal solution in the graphical method occurs at: A) The center of the feasible region B) Any point within the feasible region C) A corner point of the feasible region D) Where the profit is zero

Question

Pergunta

11. A diet planning problem can be solved using linear programming to: A) Maximize the cost of the diet B) Minimize the variety of foods C) Minimize the cost while meeting nutritional requirements D) Maximize calorie intake 12. Linear programming can help a manufacturing company: A) Predict future sales B) Maximize profit given production constraints C) Improve employee morale D) Develop new products 13. A transportation company can utilize linear programming to: A) Minimize the cost of delivering goods. B) Increase fuel consumption. C) Avoid environmental regulations. D) Maximize delivery time. 14. What does it mean if a linear programming problem is unbounded? A) The objective function can increase or decrease infinitely without violating constraints. B) The problem has no feasible solution. C) The problem has a unique optimal solution. D) The problem is degenerate. 15. What does it mean if a linear programing problem is infeasible? A) The objective function can increase or decrease infinitely without violating constraints. B) The problem has no feasible solution. C) The problem has a unique optimal solution. D) The problem is degenerate. 16. Which condition is most important for linear programming? A) Decision variables C) Constraints B) Objective function D) Linearity 17. Which statement is false in linear programming? A) Optimal solution will occur at the corner point. B) At least two corner points are optimal if there are multiple optimal solutions. C) Every decision variable should have a constraint. D) Decision variables should have a non-negativity 18. The two primary types of optimization problems in LP are: A) Minimization and Equality C) Maximization and Minimization B) Maximization and Inequality D) Equality and Inequality 19. Which of the following is a technique for optimizing a linear objective function subject to linear constraint? A). Dynamic Programming C) Linear Programming B) Linear Regression D) Network Analysis 20. The optimal solution in the graphical method occurs at: A) The center of the feasible region B) Any point within the feasible region C) A corner point of the feasible region D) Where the profit is zero

Answer 1

11. C) Minimize the cost while meeting nutritional requirements
12. B) Maximize profit given production constraints
13. A) Minimize the cost of delivering goods.
14. A) The objective function can increase or decrease infinitely without violating constraints.
15. B) The problem has no feasible solution.
16. D) Linearity
17. C) Every decision variable should have a constraint.
18. C) Maximization and Minimization
19. C) Linear Programming
20. C) A corner point of the feasible region

Pergunta

Solução

Responder