Operations Management Study Set 1

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

The constraint 3x₁ + 6x₂ ≥ 48 is converted to an equality by

Linear programming problems with two decision variables can be solved graphically.

Linear programming is a mathematical modelling technique based on linear relationships.

A linear programming model's constraints are nonlinear relationships that describe the restrictions placed on the decision variables.

___ represent a restriction on decision variable values for a linear programming problem.

Because linear programming provides an optimal solution, sensitivity analysis is never an important consideration.

The formulation for a linear programming problem cannot include more than one decision variable.

While all linear programming problems have a single objective function, very few, if any, have constraints.

The simplex method used for solving linear programming problems uses matrix algebra to solve simultaneous equations.

The optimal solution for a linear programming problem will always occur at an extreme point.

The feasible solution space contains the values for the decision variables that satisfy the majority of the linear programming model's constraints.

The constraints in a linear programming formulation define the feasible solution space.

A formulation for a linear programming model consists of a decision variable, a constraint, and several objective functions.

Operations managers find very few types of linear program models applicable today because finding an optimal solution is no longer a concern.

The optimal solution for a linear programming problem will always occur

The objective function is a linear relationship that either minimizes or maximizes some value.

In general, the objective function for linear programming problems in operations is one of minimizing costs.

Most real-world linear programming problems are solved graphically.

The simplex method is a solution method used for linear programming problems that have