# Operations Management Study Set 5

Statistics

## Quiz 19 :Linear Programming

Question Type
Linear programming techniques will always produce an optimal solution to an LP problem.
Free
True False

False

Tags
Choose question tag
A maximization problem is limited by all greater than or equal to constraints.
Free
True False

False

Tags
Choose question tag
The equation 3 xy = 9 is linear.
Free
True False

False

Tags
Choose question tag
The term range of feasibility refers to a constraint's right-hand-side quantity.
True False
Tags
Choose question tag
Constraints limit the alternatives available to a decision maker
True False
Tags
Choose question tag
The simplex method is a general-purpose LP algorithm that can be used for solving only problems with more than six variables.
True False
Tags
Choose question tag
Profit maximization could be an objective of an LP problem; but cost minimization cannot be the objective of an LP problem.
True False
Tags
Choose question tag
The feasible solution space only contains points that satisfy all constraints.
True False
Tags
Choose question tag
An objective function represents a family of parallel lines.
True False
Tags
Choose question tag
The term range of feasibility refers to coefficients of the objective function.
True False
Tags
Choose question tag
If a single optimal solution exists to a graphical LP problem, it will exist at a corner point.
True False
Tags
Choose question tag
The value of an objective function always decreases as it is moved away from the origin.
True False
Tags
Choose question tag
The equation 5 x + 7 y = 10 is linear.
True False
Tags
Choose question tag
A linear programming problem can have multiple optimal solutions.
True False
Tags
Choose question tag
The term isoprofit line means that all points on the line will yield the same profit.
True False
Tags
Choose question tag
LP problems must have a single goal or objective specified.
True False
Tags
Choose question tag
The feasible solution space is the set of all feasible combinations of decision variables as defined by only binding constraints.
True False
Tags
Choose question tag
Graphical linear programming can handle problems that involve any number of decision variables.
True False