Chapter 7 - Linear Programming Models: Graphical and Computer Methods

If a linear program is unbounded, the problem probably has not been formulated correctly. Which of the following would most likely cause this

A constraint was inadvertently omitted

Which of the following would cause a change in the feasible region

Changing the right-hand side of a non-redundant constraint

In LP, variables do not have to be integer valued and may take on any fractional value. This assumption is called

Divisibility

When using a graphical solution procedure, the region bounded by the set of constraints is called to

Feasible region

If the feasible region gets larger due to a change in one of the constraints, the optimal value of the objective function

Must increase or remain the same for a maximization problem

A feasible solution to an LP problem

Must satisfy all of the problem's constraints simultaneously

In solving a linear program, no feasible solution exists. To resolve this problem we might

Remove or relax a constraint

In the optimal solution to a linear program, there are 20 units of slack for a constraint. From this we know that

The dual price for this constraint is 0.

An LP problem has bounded a feasible region, if this problem has an equality (=) constraint, then

The feasible region must consist of a line segment

If a non-redundant constraint is removed from an LP problem, then

The feasible region will get larger

When alternate optimal solutions exist in an LP problem, then

The objective function will be parallel to one of the constraints

A linear program has been solved and sensitivity analysis has been performed. The ranges for the objective function coefficients have been found. for the profit on X1, the upper bound is 80, the lower bound is 60, and the current value is 75. Which of the following must be true if the profit on this variable is lowered to 70 and the optimal solution is found

The values for all the decision variables will remain the same

A graphical method should only be used to solve an LP problem when

There are only two variables

In an LP problem, at least one corner point myst be an optimal solution if an optimal solution exists

True