**Price: $9.99**

1. The maximum number of constraints that could define the feasible solution space is:

a. 2

b. 3

c. 4

d. unlimited

2. In an investment example of a linear programming problem, the decision variables are

a. the monetary amount invested in each investment alternative

b. the returns of the investment alternatives

c. the requirements for investing

d. none of the above

3. An optimal solution will always occur at

a. the intersection of two or more constraint lines

b. an extreme point

c. a corner point

d. all of the above

4. A popular example of a linear programming model is the

a. product mix problem

b. diet problem

c. transportation problem

d. all of the above

5. In the linear programming formulation of the shortest route problem, there is one constraint for each interior node indicating

a. capacity on each path (Not A)

b. whatever comes into a node must also go out

c. capacity on each arc

d. a maximum capacity on a path

6. The optimal solution is the ___________ feasible solution.

a. best

b. only

c. worst

d. none of the above

7. Which of the following could not be a linear programming problem constraint?

1A + 2B

1A + 2B = 3

1A + 2B > 3

1A + 2B < 3

8. The optimal solution of a minimization problem is at the extreme point _________ the origin.

a. farthest from

b. closest to

c. exactly at

d. none of the above

9. A zero-one integer problem always finds an optimal integer solution.

a. True

b. False

10. A shadow price reflects which of the following in a maximization problem?

a. the marginal gain in the objective that would be realized by adding 1 unit of a resource

b. the marginal gain in the objective that would be realized by subtracting 1 unit of a resource

c. the marginal cost of adding additional resources

d. none of the above

11. The standard constraint form in a linear programming model requires that all decision variables be on the left side of the inequality (or equality) and a single numerical value on the right side.

a. True

b. False

12. The term ______ refers to testing how a problem solution reacts to changes in one or more of the model parameters.

a. priority recognition

b. decision analysis

c. analysis of variance

d. sensitivity analysis

13. In a transportation problem, items are allocated from sources to destinations

a. at a maximum cost

b. at a minimum cost

c. at a minimum profit

d. at a minimum revenue

14. A graphical solution is usually limited to linear programming problems with

a. 1 decision variable

b. 2 decision variables

c. 3 decision variables

d. 4 decision variables

15. The region which satisfies all of the constraints in a graphical linear programming problem is called the

a. region of optimality

b. feasible solution space

c. region of non-negativity

d. optimal solution space

## No comments:

## Post a Comment