You are on page 1of 6

Quantitative Techniques for Manager

Linear Programming Quiz - 1

1. When using a graphical solution procedure, the region bounded by the set of constraints is called the
o
o
o
o
o

Solution.
Feasible region.
Infeasible region.
Maximum profit region.
None of the above.

2. Using the graphical solution procedure to solve a maximization problem requires that we
o
o
o
o
o

Move the level profit line up until it no longer intersects with any constraint equation.
Move the level profit line down until it no longer intersects with any constraint
equation.
Apply the method of simultaneous equations to solve for the intersections of
constraints.
Find the value of the objective functions at the origin.
None of the above.

3. An objective function in a linear program can be which of the following?

o
o
o
o
o

A maximization function
A nonlinear maximization function
An uncertain quantity

4. Apply linear programming to this problem. A one-airplane airline wants to determine the best mix of
passengers to serve each day. The airplane seats 25 people and flies 8 one-way segments per day. There
are two types of passengers: first class (F) and coach (C). The cost to serve each first class passenger is
\$15 per segment and the cost to serve each coach passenger is \$10 per segment. The marketing
objectives of the airplane owner are to carry at least 13 first class passenger-segments and 67 coach
passenger-segments each day. In addition, in order to break even, they must at least carry a minimum of
110 total passenger segments each day. Which of the following is one of the constraints for this linear
program?
o
o
o
o
o

15 F + 10 C => 110
1 F + 1 C => 80
13 F + 67 C => 110
1 F => 13
13 F + 67 C =< (80/200)

o
o
o
o

The primal and dual have equal number of variables.

The shadow price indicates the change in the value of the objective function, per unit
increase in the value of the RHS.
The shadow price of a non-binding constraint is always equal to zero.
The information about shadow price of a constraint is important since it may be possible
to purchase or, otherwise, acquire additional units of the concerned resource.

6. Which of the following is an essential condition in a situation for linear programming to be useful?
o
o
o
o
o

Nonlinear constraints
Bottlenecks in the objective function
Homogeneity
Uncertainty
Competing objectives

o
o
o
o

If the primal is a minimization problem, its dual will be a maximization problem.

Columns of the constraint coefficients in the primal problem become columns of the
constraint coefficients in the dual.
For an unrestricted primal variable, the associated dual constraint is an equation.
If a constraint in a maximization type of primal problem is a less-than-or-equal-to type,
the corresponding dual variable is non-negative.

8. The following five inequalities define a feasible region. Which one of these could be removed from
the list without changing the region? (Find redundant constraint)
o
o
o
o
o

x - 2y -8
y0
-x + y 10
x + y 20
x0

o
o
o
o

Allocate resources optimally.

Minimize cost of operations.
Spell out relation between primal and dual.
Determine how optimal solution to LPP changes in response to problem inputs.

10. A juice company sells three varieties of drink. The last straw (L) contains 4 ounces of apples (a), 2
ounces of blueberries (b), and 6 ounces of strawberry (s). The blue group (B) contains 2 ounces of
apples, 6 ounces of blueberries, and 4 ounces of raspberries (r). The uniform (U) contains 3 ounces each

of apples, blueberries, strawberries, and raspberries. The store can sell a 12 ounce serving of L for \$6.00;
a 12 ounce serving of B for \$ 5.00; and a 12 ounce serving of U for \$4.00. Let xi represent the number of
12 ounce servings of juice i sold for i = L, B, U. Let x0 denote the objective function (the revenue
generated from the sale of xi servings of juice i at given prices). Let yj equal the number of ounces of fruit
j used in the production for j = a, b, s, r. The juice seller wants to find xL, xB, and xU to maximize the
revenue assuming that the available supply of apples is Sa ounces, the available supply of blueberries is
Sb ounces, the available supply of strawberries is Ss ounces, and the available supply of raspberries is Sr
ounces. Which of the constraints below is consistent with this information?
o
o
o
o
o

yr Sr
x0 = 6xL + 5xB + 4xU
xL + xB + xU = ya + yb + ys + yr
xL = 4ya + 2yb + 6ys
ys = 6xL + 3xU

11. A statement that of two quantities one is specifically less than or greater than another. Symbols: < or
or > or , as appropriate.
o
o
o
o

inequality
expression
linear equation
real numbers

12. For the following system of linear inequalities, which of the following points falls in the shaded
region: 2x-3y<12, x+5y<20, x>0?
o
o
o
o

(2,6)
(6,-2)
(2,-6)
(6,2)

13. Why would one choose to solve a system of inequalities using a non-graphical method?
o
o
o
o

There are too many inequalities.

There are too many variables.

14. Find the maximum value of z=3a+2b+4c subject to the following constraints: 3a+2b+5c18,
4a+2a+3c16, and 2a+b+c4.
o
o
o
o

z=18
z=16
z=17
z=19

15. If the solution contains a variable that has a value of zero the problem is
o
o
o
o

Infeasible.
Unbounded.
Degenerate.
None of the above

16. In a maximization problem, if a constraint is of the 'greater than or equal to' type, the artificial
variable is assigned:
o
o
o
o

A very large value.

A very small value.
A very large positive value, i.e. M.
A very large negative value, i.e. M

17. Which of the following statements is true about a primal linear programming and its corresponding
dual:
o
o
o
o

The optimal value for the primal is greater than that of the dual.
The shadow prices of the primal at optimality are the values of the Structural variables of the
dual at optimality.
Each problem does not have a dual.
Both the primal and the dual are either maximization or minimization problems

18. The outgoing variable in a simplex pivot operation is the variable with:
o
o
o
o

The least replacement ratio.

A negative replacement ratio.
The maximum positive replacement ratio.
The least positive replacement ratio.

19. The feasible region represented by the constraints : x1+ x2 <= 1 , 3x1+ x2 >= 3 , x1,x2 >= 0 for the
objective function Z=x1+2x2 is:
o
o
o
o

Unbounded
Polygon
Alternate Optimal Solution
Infeasible

20. Maximize Z=2x1+4x2 Subject to :

optimal solutions to this problem is.
o
o
o

4
1
3

1. x1+2x2<=5

2.

2x1+ x2<=4 3. x1 , x2 >=0. The no. of

None of these

21. For a set of m equation in n variables(n>m), a solution obtained by setting (n-m) variables equal to
zero and solving for remaining m equations in n variables is called as.
o
o
o
o

Feasible solution
Non Feasible Solution
Basic Feasible Solution
Basic Solution

22. The method for dealing with linear programming problems involving artificial variables is
o
o
o
o

Two Phase Method

Big L Method
Auxiliary Method
Single Phase Method

23. For a maximization type of LPP, ____ property occurs where there is no constraint on the solution so
that one or more of the decision variable can be increased indefinitely without violating any of the
restrictions (constraints).
o
o
o
o

Un boundedness
Infeasibility
Alternate optimal solution
Simplex

o
o
o
o

To aid in finding initial soln. & start phases of simplex method

To find optimal dual prices in the final simplex table
Both of the above
None of the above

o
o
o
o

Variable value must remain under the control of decision maker

Value of variables makes sense & correspond to real world problem
Variables are inter related in terms of limited resources
Value of variables remain unchanged