Otros

7.7 Resource restrictions are called constraints.

ANSWER:

7.14 In a linear program, the constraints must be linear, but the objective function may be nonlinear.

ANSWER
7.21 The addition of a redundant constraint lowers the isoprofit line.

ANSWER:

7.28 Which of the following is not a part of every linear programming problem formulation?(a) an objective function
(b) a set of constraints
(c) non-negativity constraints
(d) a redundant constraint
(e) maximization or minimization of a linear function

ANSWER :

7.37 Consider the following linear programming problem:

Maximize 5X + 6Y
Subject to: 4X + 2Y  420
1X + 2Y 120
all variables  0

Which of the following points (X,Y) is not feasible?
(a) (50,40)
(b) (20,50)
(c) (60,30)
(d) (90,10)
(e) none of the above

ANSWER :

7.46 If two corner points tie for the best value of the objective function, then

(a) the solution is infeasible.
(b) there arean infinite number of optimal solutions.
(c) the problem is unbounded.
(d) the problem is degenerate.
(e) none of the above

ANSWER :


7.55 In order for a linear programming problem to have a unique solution, the solution must exist

(a) at the intersection of the non-negativity constraints.
(b) at theintersection of a non-negativity constraint and a resource constraint.
(c) at the intersection of the objective function and a constraint.
(d) at the intersection of two or more constraints.
(e) none of the above

ANSWER :

7.64 Adding a constraint to a linear programming (maximization) problem may result in, but not be limitedto,

(a) a decrease in the value of the objective function.
(b) an increase in the value of the objective function.
(c) either an increase or decrease in the value of the objective function.
(d) no change in the value of the objective function.
(e) either a decrease or no change in the value of the objective function.

ANSWER
7.73 Solve the following linearprogramming problem using the corner point method:

Maximize 10X + 1Y
Subject to: 4X + 3Y  36
2X + 4Y  40
Y  3
X, Y  0
7.82 The No-Glare Company is making two types of antique-style lamps, type #1 and type #2. There is enough skilled labor to make either 1,000 type #1 or 2,000 type #2 lamps per day. There areonly 6,000 inserts available per day, of which the type #1 requires 3 and the type #2 requires 4. Besides these shared constraints, there are only enough fancy switches to make 1,400 of the type #2 lamps per day. Management would like to make at least 10 percent more type #2 lamps than type #1 lamps; however, they do not believe that they can sell more than 25 percent more type #2 lamps thantype #1 lamps. Marginal profit (contribution) is $3 per type #1 lamp and $4 per type #2 lamp.

SIMPLEX

9.1 A basic feasible solution is a solution to a linear programming problem that corresponds to a corner point of the feasible region.

9.12 A surplus variable is added to a constraint in order to create an equality, and represents a quantity of unused resource.9-23 The basic process of the simplex algorithm is to find solutions to a set of simultaneous equations where we have more variables than equations



MULTIPLE CHOICE

9.36 Which of the following is not true about slack variables in a simplex tableau?

(a) They are used to convert  constraint inequalities to equations.
(b)...