Question 1

A(n) ___________ solution satisfies all the constraint expressions simultaneously.

Accepted Answer

A)  feasible
B)  objective
C)  infeasible
D)  extreme A

Question 2

The __________ value for each less-than-or-equal-to constraint indicates the difference between the left-hand and right-hand values for a constraint.

Accepted Answer

A)  objective function coefficient
B)  slack
C)  unbounded
D)  surplus B

Question 3

The study of how changes in the input parameters of a linear programming problem affect the optimal solution is known as

Accepted Answer

A)  regression analysis.
B)  model analysis.
C)  optimality analysis.
D)  sensitivity analysis. D

Question 4

Problems with infeasible solutions arise in practice because

Accepted Answer

A)  management doesn't specify enough restrictions.
B)  too many restrictions have been placed on the problem.
C)  of errors in objective function formulation.
D)  there are too few decision variables.

Question 5

A __________ refers to a constraint that can be expressed as an equality at the optimal solution.

Accepted Answer

A)  nonnegativity constraint
B)  first class constraint
C)  slack variable
D)  binding constraint

Question 6

The __________ assumption necessary for a linear programming model to be appropriate means that the contribution to the objective function and the amount of resources used in each constraint are in accordance to the value of each decision variable.

Accepted Answer

A)  proportionality
B)  divisibility
C)  additivity
D)  negativity

Question 7

Which of the following error messages is displayed in Excel Solver when attempting to solve an unbounded problem?

Accepted Answer

A)  Solver could not find a feasible solution.
B)  Solver cannot improve the current solution. All constraints are satisfied.
C)  Solver could not find a bounded solution.
D)  Objective Cell values do not converge.

Question 8

A scenario in which the optimal objective function contour line coincides with one of the binding constraint lines on the boundary of the feasible region leads to __________ solutions.

Accepted Answer

A)  infeasible
B)  alternative optimal
C)  binding
D)  unique optimal

Question 9

Geometrically, binding constraints intersect to form the

Accepted Answer

A)  subspace.
B)  optimal point.
C)  decision cell.
D)  zero slack.

Question 10

__________, or modeling, is the process of translating a verbal statement of a problem into a mathematical statement.

Accepted Answer

A)  Problem-solving approach
B)  Data preparation
C)  Data structuring
D)  Problem formulation

Question 11

A canned food manufacturer has its manufacturing plants in three locations across a state. Their product has to be transported to 3 central distribution centers, which in turn disperse the goods to 72 stores across the state. Which of the following is most likely to be the objective function in this scenario?

Accepted Answer

A)  Increasing the number of goods manufactured at the plant
B)  Decreasing the cost of their raw material sourcing
C)  Minimizing the cost of shipping goods from the plant to the store
D)  Minimizing the quantity of goods distributed across the stores

Question 12

The assumption that is necessary for a linear programming model to be appropriate and that ensures that the value of the objective function and the total resources used can be found by summing the objective function contribution and the resources used for all decision variables is known as

Accepted Answer

A)  proportionality.
B)  negativity.
C)  additivity.
D)  divisibility.

Question 13

Which algorithm, developed by George Dantzig and utilized by Excel Solver, is effective at investigating extreme points in an intelligent way to find the optimal solution to even very large linear programs?

Accepted Answer

A)  Ellipsoidal algorithm
B)  Complex algorithm
C)  Trial-and-error algorithm
D)  Simplex algorithm

Question 14

A mathematical function in which each variable appears in a separate term and is raised to the first power is known as a

Accepted Answer

A)  power function.
B)  linear function.
C)  what-if function.
D)  nonlinear function.

Question 15

The situation in which the value of the solution may be made infinitely large in a maximization linear programming problem or infinitely small in a minimization problem without violating any of the constraints is known as

Accepted Answer

A)  infeasibility.
B)  unbounded.
C)  infiniteness.
D)  semi-optimality.

Question 16

Rob is a financial manager with Sharez, an investment advisory company. He must select specific investments-for example, stocks and bonds-from a variety of investment alternatives. Restrictions on the type of permissible investments would be a __________ in this case.

Accepted Answer

A)  feasible solution
B)  surplus variable
C)  slack variable
D)  constraint

Question 17

Can a linear programming problem have no solution? More than one solution? Explain.

Accepted Answer

The answer of Can a linear programming problem have no...

Question 18

When formulating a constraint, care must be taken to ensure that

Accepted Answer

A)  all the objective function coefficients are included.
B)  there are no inequalities in the mathematical expression.
C)  the decision variables are set at either maximum or minimum values.
D)  the units of measurement on both sides of the constraint match.

Question 19

The change in the optimal objective function value per unit increase in the right-hand side of a constraint is given by the

Accepted Answer

A)  objective function coefficient.
B)  shadow price.
C)  restrictive cost.
D)  allowable increase.

Question 20

The shadow price of nonbinding constraints

Accepted Answer

A)  will always be zero.
B)  will always be a positive value.
C)  can never be equal to zero.
D)  is no longer valid if the right-hand side of the constraint remains the same.

Exam 12: Linear Optimization Models