Opmg LP

Linear programming techniques will always produce an optimal solution to an LP problem.

• True

• False

LP problems must have a single goal or objective specified.

• True

• False

Constraints limit the alternatives available to a decision-maker, removing constraints adds viable alternative solutions.

• True

• False

An example of a decision variable in an LP problem is profit maximization.

• True

• False

The feasible solution space only contains points that satisfy all constraints.

• True

• False

The equation 5x + 7y = 10 is linear.

• True

• False

The equation 3xy = 9 is linear.

• True

• False

Graphical linear programming can handle problems that involve any number of decision variables.

• True

• False

The feasible solution space is the set of all feasible combinations of decision variables as defined by only binding constraints.

• True

• False

The linear optimization technique for allocating constrained resources among different products is:

• linear regression analysis

• linear disaggregation

• linear decomposition

• linear programming