Test 2 Review

A company wants to select 1 project from a set of 4 possible projects. Which of the following constraints ensures that only 1 will be selected? a. X1 + X2 + X3 + X4 = 1 b. X1 + X2 + X3 + X4 ≤ 1 c. X1 + X2 + X3 + X4 ≥ 1 d. X1 + X2 + X3 + X4 ≥ 0

a. X1 + X2 + X3 + X4 = 1

A technique that allows a researcher to determine the greatest amount of material that can move through a network is called a. maximal-flow. b. maximal-spanning. c. shortest-route. d. maximal-tree.

a. maximal-flow.

Most practical applications of integer linear programming involve a. only 0-1 integer variables and not ordinary integer variables. b. mostly ordinary integer variables and a small number of 0-1 integer variables. c. only ordinary integer variables. d. a near equal number of ordinary integer variables and 0-1 integer variables.

a. only 0-1 integer variables and not ordinary integer variables.

What are binary integer variables? a. Variables with any two values, a and b. b. Variables with values 0 and 1. c. Variables whose sum of digits is 2. d. Variables with values between 0 and 1.

b. Variables with values 0 and 1.

A company wants to select no more than 2 projects from a set of 4 possible projects. Which of the following constraints ensures that no more than 2 will be selected? a. X1 + X2 + X3 + X4 = 2 b. X1 + X2 + X3 + X4 ≤ 2 c. X1 + X2 + X3 + X4 ≥ 2 d. X1 + X2 + X3 + X4 ≥ 0

b. X1 + X2 + X3 + X4 ≤ 2

In solving a facility location problem in which there are two possible locations being considered, the transportation algorithm may be used. In doing this, a. two sources would be added to the existing rows and the enlarged problem would be solved. b. two separate transportation problems would be solved. c. costs of zero would be used for each of the new facilities. d. the problem would be a transshipment problem.

b. two separate transportation problems would be solved.

How are binary variables specified in the Solver Dialog window? a. By replacing RHS values in constraints with 0 or 1. b. By specifying changing cells as INTEGER and as non-negative. c. By specifying changing cells as BINARY in the Solver add-constraint dialog window d. By selecting Assume Binary Model in the ASP Options dialog box.

c. By specifying changing cells as BINARY in the Solver add-constraint dialog window

When formulating a transportation problem with 2 sources and 4 destinations as a linear programming problem, which of the following statements is true? a. There are typically 6 decision variables and 8 constraints (excluding non-negativity constraints). b. There are typically 6 decision variables and 4 constraints (excluding non-negativity constraints). c. There are typically 8 decision variables and 6 constraints (excluding non-negativity constraints). d. There are typically 4 decision variables and 6 constraints (excluding non-negativity constraints).

c. There are typically 8 decision variables and 6 constraints (excluding non-negativity constraints).

The objective function for portfolio selection problems usually is minimization of risk or a. maximization of investment types b. minimization of cost c. maximization of expected return d. maximization of number of shares

c. maximization of expected return

The original or beginning node in a network is called a(n) a. arc. b. branch. c. source. d. sink.

c. source.

In a model, x1 > 0 and integer, x2 > 0, and x3 = 0, 1. Which solution would not be feasible? a. x1 = 5, x2 = 3, x3 = 0 b. x1 = 4, x2 = .389, x3 = 1 c. x1 = 2, x2 = 3, x3 = .578 d. x1 = 0, x2 = 8, x3 = 0

c. x1 = 2, x2 = 3, x3 = .578

Let A, B, and C be the amounts invested in companies A, B, and C. If no more than 50% of the total investment can be in company B, then a. B < 5 b. A - .5B + C < 0 c. .5A - B - .5C < 0 d. -.5A + .5B - .5C < 0

d. -.5A + .5B - .5C < 0

An LP problem has 5 binary decision variables. How many possible integer solutions are there to this problem? a. 5 b. 10 c. 25 d. 32

d. 32 2^5 = 32

The shortest-route technique would best be used to a. assign workers to jobs in the cheapest manner. b. determine the number of units to ship from each source to each destination. c. determine the amount of LAN network wiring within a building. d. determine the path for a truck making frequent but repeatable drops.

d. determine the path for a truck making frequent but repeatable drops.

The maximal-flow technique would best be used a. to assign workers to jobs in the cheapest manner. b. to determine the number of units to ship from each source to each destination. c. to determine LAN network wiring within a building. d. to maximize traffic flow on a busy highway.

d. to maximize traffic flow on a busy highway.