# Test Bank For Practical Management Science 5 Edition Wayne L Winston S Christian Albright

ISBN-13: 978-1305250901 ISBN-10: 1305250907

In Stock

\$17.00

SKU:000786000267

## Test Bank For Practical Management Science 5 Edition Wayne L Winston S Christian Albright

Chapter 3 – Introduction to Optimization Modeling

1. In an optimization model, there can only be one:

a.  decision variable

b.  constraint

c.  objective function

POINTS:   1

2. In using Excel to solve linear programming problems, the changing cells represent the:

a.  value of the objective function

b.  constraints

c.  decision variables

d.  total cost of the model

POINTS:   1

3. The condition of nonnegativity requires that:

a.  the objective function cannot be less that zero

b.  the decision variables cannot be less than zero

c.  the right hand side of the constraints cannot be greater then zero

d.  the reduced cost cannot be less than zero

POINTS:   1

4. If a manufacturing process takes 4 hours per unit of x and 2 hours per unit of y and a maximum of 100 hours of manufacturing process time are available, then an algebraic formulation of this constraint is:

a.  4x 2y≥ 100

b.  4x− 2y≤ 100

c.  4x 2y≤ 100

d.  4x− 2y≥ 100

POINTS:   1

5. The feasible region in all linear programming problems is bounded by:

a.  corner points

b.  hyperplanes

c.  an objective line

d.  all of these options

POINTS:   1

6. Suppose a company sells two different products, x and y, for net profits of \$6 per unit and \$3 per unit, respectively. The slope of the line representing the objective function is:

a.  0.5

b.  −0.5

c.  2

d.  −2

POINTS:   1

7. The equation of the line representing the constraint 4x 2y≤ 100 passes through the points:

a.  (25,0) and (0,50)

b.  (0,25) and (50,0)

c.  (−25,0) and (0,−50)

d.  (0,−25) and (−50,0)

POINTS:   1

8. When the profit increases with a unit increase in a resource, this change in profit will be shown in Solver’s sensitivity report as the:

b.  sensitivity price

POINTS:   1

9. Linear programming models have three important properties. They are:

b.  optimality, linearity and divisibility

c.  divisibility, linearity and nonnegativity

POINTS:   1

10. Consider the following linear programming problem:

Maximize 4x1 2y2

Subject to:

4x1 2y2≤ 40

2x1 y2≥ 20

x1, y2≥ 0

The above linear programming problem:

a.  has only one feasible solution

b.  has more than one optimal solution

c.  exhibits infeasibility

d.  exhibits unboundedness

POINTS:   1

## Reviews

There are no reviews yet.

\$25.00
(0 Reviews)