21MA209T - QUEUEING THEORY AND OPTIMIZATION

MCQ – PART – A

UNIT III – LINEAR PROGRAMMING problems

1. A set of values that satisfies the constraints of LPP is called
a. Solution
b. Feasible solution
c. Optimal solution
d. variables
2. Which statement characterizes the standard form of LPP
a. constraints are given in inequalities of any type
b. constraints are given by a set of linear equations
c. constraints are given only by the inequalities of type
d. constraints are given only by the inequalities of type
3. Feasible solution satisfies
a. Only constraints
b. Only non-negativity restrictions
c. (a) and (b) Both
d. (a) (b) and optimal solution
4. In the graphical method the restriction on the number of constraints is
a. 2
b. More than 2
c. 1
d. None of the above
5. In graphical solution the bounded region is known as
a. Solution
b. Basic solution
c. Feasible solution
d. Optimal solution
6. Graphical optimal value of Z can be obtained from
a. Corner points of the solution region
b. Corner nearer points of the feasible region
c. Both (a) and (b)
d. None of the above
7. If the feasible region of LPP is empty then the solution is
a. Infeasible
b. Optimal
c. Unbounded
d. Alternate solution exists
8. Any solution of LPP which satisfies the non-negativity restrictions of LPP is called
a. Solution
b. Feasible solution
c. Optimal solution
 d. variable
9. Any feasible solution which optimizes the objective function of LPP is called
a. Solution
b. Feasible solution
c. Optimal solution
d. variable
10. The variable added (or subtracted) to the constraint with a sign is
a. Basic variable
b. Non-basic variable
c. Slack variable
d. Surplus variable
11. The variable added (or subtracted) to the constraint with a sign is
a. Basic variable
b. Non basic variable
c. Slack variable
d. Surplus variable
12. A basic solution is said to be non-degenerate if none of the basic variables is
a. Appears in the constraint
b. Negative
c. Positive
d. zero
13. The solution which satisfies the constraints and does not optimize the objective function since it
contains a very large penalty M is called
a. Feasible solution
b. Optimal solution
c. Pseudo optimal solution
d. Basic solution
14. Minimize Z =
a. – Max (Z)
b. – Max (- Z)
c. Max (- Z)
d. None of the above
15. Under two Phase method, Phase II can proceed when the Artificial variable is present in the
simplex table with a value
a. 1
b. 0
c. 3
d. -1

16. For every LPP there exists a unique LPP associated with it involving the same data and closely
related optimal solution, the original problem is called the Primal while the other is called as
a. Optimal Problem
b. Dual Problem
c. Standard Problem
d. Feasible Problem
17. The Optimal solution of Primal and Dual are equal, but the value of dual variables is called the
a. Feasible price
b. Optimal dual price
c. Shadow price
d. None
18. In the dual simplex method the leaving variable is the basic variable corresponding to the most
negative value of
a.
b.
c. (answer)
d.
19. If all , then the current solution is
a. Feasible solution
b. Optimal solution
c. Bounded solution
d. Unbounded solution
20. The dual of the Primal is
a.
b.
c. (answer)
d.
UNIT – IV – TRANSPORTATION AND ASSIGNMENT PROBLEM
1. The necessary and sufficient conditions for a transportation problem to have a feasible solution is
a. Total supply > Total demand
b. Total supply < Total demand
c. Total supply = Total demand
d. Total supply ≠ Total demand
2. A transportation problem is said to be balanced if
a. Total supply > Total demand
b. Total supply < Total demand
c. Total supply = Total demand
d. Total supply ≠ Total demand
3. For any Transportation problem the co-efficient of the constraints is
a. Positive
b. Negative
c. Zero
d. One
4. A m x n transportation problem has a basic feasible solution if it has the number of non-negative
allocations to be
 a. Equal to m + n – 1
b. Greater than m + n – 1
c. Less than m + n – 1
d. MxN

5. A basic feasible solution in TP is said to be the degenerate solution if the number of non-negative
allocations is
a. Equal to m + n – 1
b. Greater than m + n – 1
c. Less than m + n – 1
d. M x N
6. The method used to obtain the optimal solution for TP is
a. North West Corner Rule
b. Least Cost method
c. MODI method
d. Vogel’s approximation method
7. The assignment problem is a particular case of
a. Standard LPP
b. Primal Problem
c. Dual Problem
d. Transportation Problem
8. The algorithm used to solve the Assignment problem is
a. Hungarian
b. MODI
c. VAM
d. North-west corner Rule
9. The Dual Simplex method fails if
a. ( Z j−C j ) ≥ 0 and all X B ≥ 0.
i

b. ( Z j−C j ) ≥ 0 And at least one X B ≤ 0.

i

c. ( Z j−C j ) =0
d. ( Z j−C j ) < 0 (Answer)
10. The conversion of the maximization problem into an equivalent minimization problem in the
Assignment problem can be done by
a. Multiply all the cost elements of the cost matrix by -1.
b. Subtract all the cost elements of the cost matrix from the highest cost element in that cost
matrix.
c. Either a or b.
d. Neither a nor b.

UNIT - V CLASSICAL OPTIMIZATION THEORY

1. In nonlinear programming the boundaries of the contours of the function are

a. Parallel Lines
b. Zigzag lines
 c. Straight lines
d. Trapezoidal lines
2. One of the techniques developed for the solution of nonlinear programming is?
a. Single programming
b. multilinear programming
c. Reverse programming
d. Dynamic programming
3. The method of feasible direction can be grouped under the
a. Direct methods of approach
b. Sequential methods of approach
c. Terminate methods of approach
d. Laminar methods of approach
4. The first nonlinear programming procedure to be applied in the year
a. 1950
b. 1940
c. 1960
d. 1970
5. One of the elements considered in the prestressed concrete structural system economy is
a. Structural Optimization
b. Beam Optimization
c. Slab Optimization
d. Transverse Optimization

6. A function f ( x ) is said to have ___________ with single variable at x=x 0 if f (x 0) ≥ f ( x 0 +h ) for all
sufficiently small positive and negative values of h.
a. Local minima
b. Local maxima
c. Global maxima
d. Global minima

7. A function f ( x ) is said to have ___________ with single variable at x=x 0 if f (x 0) ≤ f ( x 0 +h ) for all
sufficiently small positive and negative values of h.
a. Local minima
b. Local maxima
c. Global maxima
d. Global minima
8. The necessary condition for the extreme points of f (x 1 , x 2) is
∂f
a. =0
∂ x1
∂f
b. =0
∂ x2
c. Both a and b
d. None of the above.
9. If the Hessian matrix H 1 , H 2 , H 2 … … are Positive (i.e.) H is Positive-definite at a point P then f (X )
is
a. Minimum at P
b. Maximum at P
c. Saddle point at P
d. Either a or c.
10. If the Hessian matrix H 1 , H 2 , H 2 … … are alternatively negative, positive (i.e.) H is Negative-
definite at a point P then f (X ) is
a. Minimum at P
b. Maximum at P
c. Saddle point at P
d. Either b or c.
11. If the Hessian matrix H 1 , H 2 , H 2 … … are not of same sign with some of the value is zero (i.e.) H
is indefinite at a point P then f (X ) is
a. Minimum at P
b. Maximum at P
c. Saddle point at P
d. Either a or b.

12. If a is a stationary point of f (x) then if the first (n-1) derivatives are zero and f n (a) ≠ D then
( a , f (a) ) is an inflexion point then
a. n is odd.
b. n is even.
c. n is prime.
d. n is integer.
13. If a is a stationary point of f (x) then if the first (n-1) derivatives are zero and f n ( a ) >0 then ( a , f (a) )
is minimum point then
a. n is odd.
b. n is even.
c. n is prime.
d. n is integer.
14. If a is a stationary point of f (x) then if the first (n-1) derivatives are zero and f n ( a ) <0 then ( a , f (a) )
is maximum point then
a. n is odd.
b. n is even.
c. n is prime.
d. n is integer.
15. Newton-Raphson formula is given by
a. x n+1=x n +2−x 0
b. x n+1=x n −f (x n )
f (x n)
c. x n+1=x n −
f ' ( xn)
d. None of the above.