The decision variables in transportation problems are also called: Profits Costs Capacities Flows 2. The constraint X1+X2+X3+X4 = X Y = < X X =

1. The decision variables in transportation problems are also called:

1. Profits

2. Costs

3. Capacities

4. Flows

2. The constraint X1+X2+X3+X4 <= 2 with 0 -1 integer programming allows at least two of the items X1, X2, X3, and X4 to be selected to be a part of the optimal solution

TRUE OR FALSE

3. Rounding the optimal values in the decision variable cells of a linear programming model does not provide us with the the optimal integer solution

TRUE OR FALSE

4. The minimal-spanning technique would best be used:

1. To minimize traffic flow on a busy highway

2. To assign workers to jobs in the cheapest manner

3. To determine LAN network wiring within a building

4. By a trucking company making frequent but repeatable drops

5. Transshipment points are locations where goods neither originate nor end up, but goods are allowed to enter such points to be shipped out to their eventual destinations

TRUE OR FALSE

6. In a typical network model representation of the transportation problem, the nodes indicate

1. Geographic locations

2. Roads

3. Rivers

4. Rail lines

7. In a transportation problem of three plants to three customers with standard subscripting in the decision variables as done in lecture, the constraints of X21 + X22 + X23 =< 200 represents:

1. Total demand required constraint for customers 1, 2, and 3

2. Demand constraint for customer 2

3. Total supply constraint on plants 1, 2, and 3

4. Supply constraint for plant 2

8. An integer programming (maximization) problem was first solved a linear programing problem, and the optimal profit was $253.67. The two decision variables (X,Y) in the problem had values of X = 12.45 and Y = 32.75. If there is a single optimal integer solution, which of the following must be true for the optimal integer solution to the problem?

1. X = 12, Y = 32

2. X = 12, Y = 33

3. The objective function value must be less than $253.67

4. The objective function value will be greater than $253.67

9. As part of a larger problem, you are trying to determine whether ot not to open a plant with a capacity of 10,000 units (using binary variable Y). You also define X as the number of units (if any) produced at that plant. How will you ensure that Y will equal 1 if the production quantity is positive, or otherwise equal 0 if the plant is not open?

1. Y >= X

2. Y =< X

3. X = 10000Y

4. X =< 10000Y

10. The constraint X1 + X2 =< 1 with 0 -1 integer programming allows for either both X1 and X2 to be selected to be a part of the optimal solution, or for neither to be selected

TRUE OR FALSE

11. The objective of the transportation problem is to:

1. Minimize the number of shipments necessary to satisfy total demand at the destination

2. Minimize the number of origins used to satisfy total demand at the destinations

3. Minimize the cost of shipping products from several origins to several destinations

4. Identify one origin that can satisfy total demand at the destinations and at the same time minimize total shipping

12. Problems which deal with matching machines to jobs are called:

1. Blending problems

2. Shortest path problems

3. Transportation problems

4. Assignment problems

13. Constraining the variables as bin, will restrict the decision variable to 0 or 1 in Excel

TRUE OR FALSE

14. Assignment problems solved by linear programming techniques are also examples of:

1. Mixed integer programming problems

2. Pure integer programming problems

3. Goal programming problems

4. Zero-one integer programming problems

15. The graph of a two variable problem that requires x and y to be integer has a feasible region:

1. Of vertical stripes

2. Of horizontal stripes

3. As a set of dots

4. The same as its LP feasible region

16. Rounding the optimal values in the decision variable cells of a linear programming model provides us with the optimal integer solution

TRUE OR FALSE