The slack value for binding constraints is
a. always a positive integer.
b. a negative integer.
c. equal to the sum of the optimal points in the solution.
d. zero.
d. zero.
Which of the following error messages is displayed in Excel Solver when attempting to solve an unbounded problem?
a. Solver could not find a feasible solution.
b. Solver cannot improve the current solution. All constraints are satisfied.
c. Solver could n
d. Objective Cell values do not converge.
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
b. additivity.
A(n) _____________ refers to a set of points that yield a fixed value of the objective function.
a. objective function contour
b. infeasible solution
c. feasible region
d. objective function coefficient
a. objective function contour
Suppose that profit for a particular product is calculated using the linear equation: Profit = 20S + 3D. Which of the following combinations of S and D would yield a maximum profit?
?
a. S = 0, D = 299
b. S = 0, D = 0
c. S = 405, D = 0
d. S = 182, D = 145
c. S = 405, D = 0
In problem formulation, the
a. constraints are expressed in terms of the obtained objective function coefficients.
b. nonnegativity constraints are always ignored.
c. objective is expressed in terms of the decision variables.
d. optimal solution is decide
c. objective is expressed in terms of the decision variables.
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 _________ i
a. constraint
Constraints are
a. quantities to be minimized in a linear programming model.
b. restrictions that limit the settings of the decision variables.
c. quantities to be maximized in a linear programming model.
d. input variables that can be controlled during o
b. restrictions that limit the settings of the decision variables.
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.
a. infeasible
b. alternative optimal
c. binding
d. unique optimal
b. alternative optimal
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?
a. The simplex algorithm
b. The trial-and-error
b. The trial-and-error algorithm
GE produces 5 different sizes of TVs using 2 machines. Different sizes of TVs take different amount of time to get processed at each of the two machines, and bring in different amount of profit for the company per unit. GE has a limited amount of time to
b. A constraint
In the analysis of a typical decision analysis problem such as the two problems above, all but one of the following can be achieved. Which of the following cannot be achieved?
a. Incorporate uncertainty in decision making
b. Help ensure the best state of
b. Help ensure the best state of nature happens
Problems with infeasible solutions arise in practice because
a. management doesn't specify enough restrictions.
b. of errors in objective function formulation.
c. there are too few decision variables.
d. too many restrictions have been placed on the probl
d. too many restrictions have been placed on the problem.
A mathematical function in which each variable appears in a separate term and is raised to the first power is known as a
a. nonlinear function.
b. power function.
c. linear function.
d. what-if function.
c. linear function.
A controllable input for a linear programming model is known as a
a. parameter.
b. decision variable.
c. constraint.
d. dummy variable.
b. decision variable.
A canned food manufacturer has its manufacturing plants in three locations across a state. Their product has to be transported to three central distribution centers, which in turn disperse the goods to seventy-two stores across the state. Which of the fol
b. Minimizing the cost of shipping goods from the plant to the store
Geometrically, binding constraints intersect to form the
a. optimal point.
b. decision cell.
c. subspace.
d. zero slack.
a. optimal point.
A(n) ___________ solution satisfies all the constraint expressions simultaneously.
a. infeasible
b. extreme
c. feasible
d. objective
c. feasible
_____________ or modeling, is the process of translating a verbal statement of a problem into a mathematical statement.
a. Problem formulation
b. Data preparation
c. Problem-solving approach
d. Data structuring
a. Problem formulation
Nonnegativity constraints ensure that
a. there are no inequalities in the constraints.
b. the problem modeling includes only nonnegative values in the constraints.
c. the solution to the problem will contain only nonnegative values for the decision variab
c. the solution to the problem will contain only nonnegative values for the decision variables.
In a linear programming model, the __________ assumption plus the nonnegativity constraints mean that decision variables can take on any value greater than or equal to zero.
a. additivity
b. proportionality
c. negativity
d. divisibility
d. divisibility
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.
a. n
c. proportionality
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. Which of the following statements is most likely to be the objective funct
c. Maximization of expected return
The shadow price of nonbinding constraints
a. is no longer valid if the right-hand side of the constraint remains the same.
b. will always be a positive value.
c. will always be zero.
d. can never be equal to zero.
c. will always be zero.
A variable subtracted from the left-hand side of a greater-than-or-equal to constraint to convert the constraint into an equality is known as a(n)
a. slack variable.
b. unbounded variable.
c. surplus variable.
d. binding constraint.
c. surplus variable.
A canned food manufacturer has its manufacturing plants in three locations across a state. Their product has to be transported to three central distribution centers, which in turn disperse the goods to seventy-two stores across the state. Which of the fol
b. A network graph
A ___________ refers to a constraint that can be expressed as an equality at the optimal solution.
a. slack variable
b. binding constraint
c. first class constraint
d. nonnegativity constraint
b. binding constraint
____________ is the situation in which no solution to the linear programming problem satisfies all the constraints.
a. Optimality
b. Infeasibility
c. Divisibility
d. Unboundedness
b. Infeasibility