OPS rq 9

Two or more products are produced using limited resources. The firm would like to determine how many units of each product it should produce to maximize overall profit given its limited resources.

This situation describes what type of problem in linear​ programming?

A. product-scheduling
B. sensitivity
C. production-quantity
D. product-mix

D. product-mix

An optimal solution to a linear programming problem MUST lie

A. somewhere outside of the feasible region.
B. somewhere on the line between two corner points.
C. at the intersection of at least two constraints.
D. somewhere in the interior of the feasible region.

C. at the intersection of at least two constraints.

In linear​ programming, what are restrictions that limit the degree to which a manager can pursue an​ objective?

A. gatekeepers
B. resource rules
C. limitations
D. constraints

D. constraints

What is a mathematical expression in linear programming that maximizes or minimizes some​ quantity?

A. maximin function
B. objective function
C. goal function
D. purpose function

B. objective function

Linear programming is a mathematical technique designed to help operations managers plan and make decisions necessary to allocate

A. liabilities.
B. corporate dividends.
C. resources.
D. employee bonuses.

C. resources.

If A​, B​, and C are​ variables, which of the following functions is NOT​ linear?

A. 14A – 4B​ + C
B. ABC
C. A
D. 2A​ + 3B​ + 6C

B. ABC

The graphical solution to a linear programming problem can only be used when there are two

A. available resources.
B. objective functions.
C. constraints.
D. decision variables.

D. decision variables.

In linear​ programming, choices available to a decision maker are called

A. decision variables.
B. choice variables.
C. objectives.
D. constraints.

A. decision variables.

What are the four requirements of a linear programming​ problem?

an​ objective, constraints,​ alternatives, and linearity

What is the value of one additional unit of a scarce resource in​ LP?

A. incremental value
B. resource value
C. conditional value
D. shadow price

D. shadow price

In a typical​ product-mix problem in linear​ programming, the objective is to

A. minimize resource usage.
B. maximize profit.
C. maximize total production.
D. minimize cost.

B. maximize profit.

n a typical​ product-mix problem in linear​ programming, each general constraint states that

A. the number of products produced greater than or equal to the amount of resource available.
B. the amount of a resource used less than or equal to the amount of resource available.
C. the number of products produced less than or equal to the amount of resource available.
D. the amount of a resource used greater than or equal to the amount of resource available.

B. the amount of a resource used less than or equal to the amount of resource available.

What is the name of the algorithm that solves linear programming problems of all​ sizes?

A. duplex method
B. dual value method
C. simplex method
D. graphical solution approach

C. simplex method

Which of the following is an approach to solving a linear programming minimization problem​ graphically?

A. corner point method
B. iso-profit
C. shadow price
D. postoptimality analysis

A. corner point method

In linear​ programming, a solution that does not simultaneously satisfy all constraints is called an

A. illogical solution.
B. intermediate solution.
C. impossible solution.
D. infeasible solution.

D. infeasible solution.