# Operations Management Study Set 1

## Quiz 14 : Sales and Operations Planning Study Flashcards  Looking for Management Homework Help?

## Quiz 14 :Sales and Operations Planning

Question Type  The area that contains the values that satisfies all the constraints in a linear programming problem is known as the ___ space.
Free
Multiple Choice

C

Tags
Choose question tag  The constraint 3x1 + 6x2 ≥ 48 is converted to an equality by
Free
Multiple Choice

B

Tags
Choose question tag  Linear programming problems with two decision variables can be solved graphically.
Free
True False

True

Tags
Choose question tag  Linear programming is a mathematical modelling technique based on linear relationships.
True False
Tags
Choose question tag  A linear programming model's constraints are nonlinear relationships that describe the restrictions placed on the decision variables.
True False
Tags
Choose question tag  ___ represent a restriction on decision variable values for a linear programming problem.
Multiple Choice
Tags
Choose question tag  Because linear programming provides an optimal solution, sensitivity analysis is never an important consideration.
True False
Tags
Choose question tag  The formulation for a linear programming problem cannot include more than one decision variable.
True False
Tags
Choose question tag  While all linear programming problems have a single objective function, very few, if any, have constraints.
True False
Tags
Choose question tag  The simplex method used for solving linear programming problems uses matrix algebra to solve simultaneous equations.
True False
Tags
Choose question tag  The optimal solution for a linear programming problem will always occur at an extreme point.
True False
Tags
Choose question tag  The feasible solution space contains the values for the decision variables that satisfy the majority of the linear programming model's constraints.
True False
Tags
Choose question tag  The constraints in a linear programming formulation define the feasible solution space.
True False
Tags
Choose question tag  A formulation for a linear programming model consists of a decision variable, a constraint, and several objective functions.
True False
Tags
Choose question tag  Operations managers find very few types of linear program models applicable today because finding an optimal solution is no longer a concern.
True False
Tags
Choose question tag  The optimal solution for a linear programming problem will always occur
Multiple Choice
Tags
Choose question tag  The objective function is a linear relationship that either minimizes or maximizes some value.
True False
Tags
Choose question tag  In general, the objective function for linear programming problems in operations is one of minimizing costs.
True False
Tags
Choose question tag  Most real-world linear programming problems are solved graphically.
True False   