Question Type

All

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

Free

Multiple Choice

Answer:

Answer:

C

Choose question tag

The constraint 3x

_{1}+ 6x_{2}≥ 48 is converted to an equality by Free

Multiple Choice

Answer:

Answer:

B

Choose question tag

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

Free

True False

Answer:

Answer:

True

Choose question tag

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

True False

Answer:

Choose question tag

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

True False

Answer:

Choose question tag

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

Multiple Choice

Answer:

Choose question tag

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

True False

Answer:

Choose question tag

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

True False

Answer:

Choose question tag

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

True False

Answer:

Choose question tag

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

True False

Answer:

Choose question tag

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

True False

Answer:

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

Answer:

Choose question tag

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

True False

Answer:

Choose question tag

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

True False

Answer:

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

Answer:

Choose question tag

Choose question tag

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

True False

Answer:

Choose question tag

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

True False

Answer:

Choose question tag

Choose question tag

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

Multiple Choice

Answer:

Choose question tag