V-348 Quizzes for Exam 2

a

Compared to product mix problems, transportation problems are unique because: a. the solution values are always integers. b. they contain fewer variables. c. the constraints are all equality constraints with no "≤" or "≥" constraints. d. they maximize profit.

d

Decision variables: a. Measure the objective function b. Measure the values of each constraint c. Always exist for each constraint d. Measure how much or how many items to produce, purchase, hire, etc.

d

If the constraint 3x1 + 4x2 + (d1-) - (d1+) = 250 measured hours, then: a. If d1- is equal to 25, then 3x1 + 4x2 must equal b. Overtime could be represented by d1 c. D1- hours can take only an integer value d. 3x1 + 4x2 is equal to the actual time spent.

b

If the solution values of a linear program are rounded in order to obtain an integer solution, the solution is: a. Always optimal and feasible b. Sometimes optimal and feasible c. Always feasible d. Never optimal and feasible

b

If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a ________ constraint. a. Mutually exclusive b. Corequisite c. Conditional d. Multiple choice

d

In a ____________________ integer model, some solution values for decision variables are integers and others can be non-integers. a. 0-1 b. Total c. Total, 0-1, and mixed d. Mixed

d

In a capital budgeting problem, if either project 1 or project 2 is selected, then project 5 cannot be selected. Which of the alternatives listed below correctly models this situation? a. X1 + x2 + x5 >= 1 b. X1 - x5 <= 1, x2 - x5 <= 1 c. X1 + x2 + x5 <= 1 d. X1 + x5 <= 1, x2 + x5 <= 1

d

In a linear programming problem, a valid objective function can be represented as: a. Max Z = 5xy b. Max Z = 5x(2+2y) c. Min (x1 + x2) / x3 d. Max 3x + 3y + 1/3 z

b

In a portfolio problem, X1, X2, and X3 represent the number of shares purchased of stocks 1, 2, and 3, which have selling prices of $15, $47.25, and $110, respectively. The investor has up to $50,000 to invest. The stockbroker suggests limiting the investments so that no more than $10,000 is invested in stock 2 or the total number of shares of stocks 2 and 3 does not exceed 350, whichever is more restrictive. How would this be formulated as a linear programming constraint? a. X2≤ 10000 and X2 + X3 ≤ 350 b. 47.25X2 ≤ 10,000 and X2 + X3 ≤ 350 c. 47.25X2 ≤ 10,000 and 47.25 X2 + 110X3 ≤ 350 d. 10,000 X2≤ 350X2 + 350X3

b

In a transportation problem, items are allocated from sources to destinations: a. at a minimum revenue. b. at a minimum cost. c. at a maximum cost. d. at a minimum profit.

d

In an assignment problem all supply and demand values equal are: a. greater than 1 b. 0 c. 2 d. 1

a

In the formulation of a >= constraint: a. A surplus variable is subtracted b. A sack variable is added c. A surplus variable is added d. A slack variable is subtracted

b

A decision with more than one objective: a. Depends on the probability of satisfying each objective b. Requires the decision maker to put the objectives in some order of importance c. Cannot have an optimal solution d. Should be decomposed into a separate model for each objective

a

A positive deviational variable is the amount by which a goal level is: a. Exceeded b. Underachieved c. Maximized d. Minimized

b

Assume that X2, X7 and X8 are the dollars invested in three different common stocks from New York Stock Exchange. In order to diversify the investments, the investing company requires that no more than 60% of the dollars invested can be in "stock 2". The constraint for this requirement can be written as: a. .4x2- .6x7- .6x8 ≥ 0. b. .4x2- .6x7- .6x8 ≤ 0. c. x2 ≥ .60. d. x2 ≥.60 (x2+ x7 + x8).

d

At least one or both deviational variables in goal constraint must equal: a. 1 b. 2 c. -1 d. 0

a

Multiple optimal solutions provide ___________ flexibility to the decision maker a. Greater b. Greater or equal c. Less or equal d. Less

a

Quickbrush Paint Company is developing a linear program to determine the optimal quantities of ingredient A and ingredient B to blend together to make oil-base and water-base paint. The oil-base paint contains 90 percent A and 10 percent B, whereas the water-base paint contains 30 percent A and 70 percent B. Quickbrush currently has 10,000 gallons of ingredient A and 5,000 gallons of ingredient B in inventory and cannot obtain more at this time. Assuming that x represents the number of gallons of oil-base paint, and y represents the gallons of water-base paint, which constraint is correctly represents the constraint on ingredient A? a. .9x + .3y ≤ 10,000 b. .9A + .1B ≤ 10,000 c. .3x + .7y ≤ 10,000 d. .9x + .1y ≤ 10,000

d

The assignment problem constraint x41 + x42 + x43 + x44 ≤ 3 means: a. There is no feasible solution. b. agent 3 can be assigned to 4 tasks. c. a mixture of agents 1, 2, 3 and 4 will be assigned to tasks 1, 2 or 3. d. agent 4 can be assigned to 3 tasks.

b

The linear programming model for a transportation problem has constraints for supply at each ________ and ________ at each destination. a. source, destination b. source, demand c. demand, source d. destination, source

a

The optimal solution of a minimization problem is at the extreme point _________ the origin. a. Closest to b. Exactly at c. Parallel to d. Farthest from

d

The theoretical limit on the number of constraints that can be handled by a linear programming problem is: a. 3 b. 2 c. 4 d. Unlimited

c

Types of integer programming models are: a. Total b. Mixed c. Total, 0-1, and mixed d. 0-1

b

Which of the following assumptions is not an assumption of the transportation model? a. There is one transportation route between each source and destination. b. Actual total supply and actual total demand must be equal. c. There is one transportation mode between each source and destination. d. Shipping costs per unit are constant.

a

Which of the following is not a typical characteristic of a linear programming problem? a. The problem can be solved graphically b. The problem has an objective c. A choice among alternatives is required d. Restrictions exist

b

Which of the following is not an integer linear programming problem? a. Pure integer b. Continuous c. 0-1 integer d. Mixed integer

a

Which of the following statements is not true? a. An infeasible solution violates all constraints b. An optimal solution satisfies all constraints c. A feasible solution point does not have to lie on the boundary of the feasible solution d. A feasible solution satisfies all constraints

a

Without satisfying the non-negativity constraint, a solution that satisfies all the other constraints of a linear programming problem is called: a. Infeasible b. Feasible c. Semi-feasible d. Optimal

c

______________ is used to analyze changes in model parameters a. A slack variable b. Optimal solution c. Sensitivity analysis d. Feasible solution