Chapter 7 and 8- Linear Programming Models

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

Feasible region

How many points are in a feasible region

Infinite

Using LP to maximize audience exposure in an advertising campaign is known as an example type problem

Media selection

When applying LP to diet problems, the objective function is usually designed to

Minimize the cost of nutrient buns

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

Surplus >

Normal access above the minimum requirement

Slack <

Normal unused resources

The selection of specific investments from among a wide variety of alternatives is the type of LP problem known as

Portfolio selection problem

When you add one more assembly hour it would be

Positive

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

Remove or relax a constraint

Which of the following does not represent a factor a manager might consider when applying LP for a production scheduling

Risk assessment

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

What is the difference between the optimal point and the Feasible point

The optimal is the best fit, a feasible point is any point in the feasible region

The following problem type Is such a special case of LP that a special algorithm has been developed to solve it

The production mix problem

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

When your programming can be used to select effective media mixes, Allocate fixed or limited budgets across media, and minimize audience exposure

True

A typical transportation problem has four sources and three destinations. How many decision variables with there be in this linear program

12

A typical transportation problem has four sources and three destinations. How many constraints with there be in this LP

7

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

The diet problem is

Also called the Phoenix problem in agriculture, a special case of the ingredients mix problem, a special case of the blending problem.

Which of the following would have a one as the right-hand side value for each constraint

And assignment problem

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

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

What are the corner points on the feasible region

Depends on the specific problem

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

Divisibility