VISION COLLEGE OF MANAGEMENT, KANPUR
INTERNAL SESSIONAL -1(2023-2024) EVEN SEMESTER
Subject: Optimization Techniques
Note: This question paper contains 50 questions. Each question carries equal marks.
1. Solution which satifies all the constraints of linear programming problem is
called
(a) Feasible solution (b) Bounded solution (c) Unbounded solution (d) None of
these
2. Any feasible solution of a canonical maximization (respectively minimization)
linear programming problem which maximizes (respectively minimizes) the
objective function is called
(a) Feasible solution (b) Optimal solution (c) Unbounded solution (d) Bounded
solution
3. If the constraint set S of a canonical maximization or a canonical minimization
linear programming problem is bounded, then the maximum or minimum value of
the objective function is attained at the
(a) Extreme point of S (b) Interior of S (c) Exterior of S (d) Boundary of S
4. ”Any unbounded linear programming problem has an unbounded constraint
set”.
(a) The above statement is always TRUE (b) The above statement is always FALSE
(c) The above statement can be TRUE or FALSE (d) Insufficient data
5. ”Any linear programming problem having an unbounded constraint set is
unbounded”.
(a) The above statement is always TRUE (b) The above statement is always FALSE
(c) The above statement can be TRUE or FALSE (d) Insufficient data
MM:50
6. Intersection of convex sets
(a) is not a convex set (b) may be a convex set (c) is a convex set (d) cannot be
determined
7. The closed ball of radius r > 0 centered at the origin in R3 is a
(a) Cirlce and its interior (b) Circle (c) Sphere (d) Sphere and its interior
8. Which of the following is/are bounded sets? (i) unit square, (ii) unit circle, (iii)
The first octant, (iv) a closed ray in R1
(a) i,iii,iv (b) only ii (c) i and ii only (d) ii,iii,iv
9. A linear programming problem having an empty constraint set is said to be
(a) Feasible (b) Bounded (c) Unbounded (d) Infeasible
10. A linear programming problem having 6 main constraints and 3 nonnegativity
constraints.Find the upper bound for the number of extreme point candidates.
(a) 504 (b) 120 (c) 20 (d) 84
11. Find the norm of x where x = (2, −1, 0, −2) ∈ R4
(a) 3 (b) 9 (c) -1 (d) √ 3
12. Which of the following is/are non convex set(s)? (i) x-axis, (ii) R2 − {(0, 0)} (iii)
Unit Circle
(a) all the above (b) i,iii but not ii (c) ii and iii but not i (d) only i
13. ”Union of convex sets
(a) is always convex set (b) may be a convex set (c) is never a convex set (d) cannot
be determined
[Type here]
14. The simplex algorithm was developed in the year 1940 by
(a) A.W. Tucker (b) James K Strayer (c)George Cantor (d)George B. Dantzig
15. Slack variables are always
(a) Positive (b) Non-negative (c) Zero (d) Negative
16. The variables to the north of the maximum tableau are called
(a) Basic variables (b) Slack variables (c) Non-basic variables (d) Dependent
variables
17. The variables to the west of the minimum tableau are called
(a) Basic variables (b) Slack variables (c) Non-basic variables (d) Dependent
variables
18. The variables to the east of the maximum tableau are called
(a) Basic variables (b) Slack variables (c) Non-basic variables (d) Independent
variables
19. The variables to the south of the minimum tableau are called
(a) Basic variables (b) Slack variables (c) Non-basic variables (d) Independent
variables
20. A basic solution is a solution obtained by setting
(a) some independent variables equal to zero (b) all independent variables equal
to zero (c) some dependent variables equal to zero (d) all dependent variables
equal to zero
21. A basic solution
(a) is always a basic feasible solution (b) cannot be a basic feasible solution (c)
may be a basic feasible solution (d) none of the above
2
22. The Tucker tableau is said to be maximum basic feasible if
(a) some bi ’s> 0 (b) some cj ’s> 0 (c) all cj ’s> 0 (d) all bi ’s> 0
23. The maximization problem is unbounded if
(a) atleast one cj > 0 and aij ≤ 0foralli (b) for all cj > 0 and aij ≤ 0forsomei (c) for all
cj < 0 and aij < 0forsomei (d) atleast one cj > 0 and aij ≥ 0foralli
24. In a maximum basic feasible table if all the cj ’s are non-negative then the
basic solution of this table is
(a) Not optimal (b) May be optimal (c) always optimal (d) Cannot be determined
25. The maximization problem is infeasible if
(a) atleast one bi < 0 and aij ≤ 0foralli (b) atleast one bi < 0 and aij ≥ 0foralli (c)
atleast one bi > 0 and aij ≤ 0foralli (d) atleast one bi > 0 and aij ≥ 0foralli
26. A pivot entry is
(a) always negative (b) always positive (c) always zero (d) always non-zero
27. A real variable in a linear programming problem is said to be unconstrained if
there is
(a) nonnegativity constraint on the variable. (b) no nonnegativity constraint on the
variable. (c) positivity constraint on the variable. (d) negativity constraint on the
variable.
28. Noncanonical linear programming problem can have (i) Unconstrained
Variables (ii)Equations of Constraint
(a) only (i) (b) only (ii) (c) (i) or (ii) or both (d) None of these
29. If noncanonical linear programming problem has an equation of constraint
then we introduce
[Type here]
(a) slack ”variable” 0 (b) slack ”variable” t1 > 0 (c) slack ”variable” t1 < 0 (d) all the
above
30. A canonical tableau is a tableau having
(a) unconstrained independent variables and no slack ”variables” of 0. (b) no
unconstrained independent variables and slack ”variables” of 0. (c) no
unconstrained independent variables and no slack ”variables” of 0. (d)
unconstrained independent variables and slack ”variables” of 0.
31. Apply the simplex algorithm to (i) Canonical Table (ii) non canonical table
(a) only ii (b) only i (c) both i and ii (d) i or ii
32. In noncanonical maximum tableaus
(a) rows corresponding to pivoted unconstrained variables are filed and deleted.
(b) rows corresponding to pivoted unconstrained variables are filed and never
deleted. (c) columns corresponding to pivoted unconstrained variables are filed
and deleted. (d) columns corresponding to pivoted unconstrained variables are
filed and never deleted.
33. In noncanonical minimum tableaus
(a) rows corresponding to pivoted unconstrained variables are filed and deleted.
(b) rows corresponding to pivoted unconstrained variables are filed and never
deleted. (c) columns corresponding to pivoted unconstrained
variables are filed and deleted. (d) columns corresponding to pivoted
unconstrained variables are filed and never deleted.
34. In noncanonical maximum tableaus
3
(a) columns corresponding to slack ”variables” of 0 are deleted. (b) rows
corresponding to slack ”variables” of 0 are deleted. (c) columns corresponding to
slack”variables” of 0 are never deleted. (d) rows corresponding to slack
”variables” of 0 are never deleted.
35. In noncanonical minimum tableaus
(a) columns corresponding to slack ”variables” of 0 are deleted. (b) rows
corresponding to slack ”variables” of 0 are deleted. (c) columns corresponding to
slack”variables” of 0 are never deleted. (d) rows corresponding to slack
”variables” of 0 are never deleted.
36. Slack ”variables” of 0 (corresponding to equations of constraint) in non
canonical maximum tableaus always
(a) get pivoted up-from east to north (b) get pivoted up-from north to east (c) get
pivoted up-from west to south (d) get pivoted up-from south to west
37.Slack ”variables” of 0 (corresponding to equations of constraint) in non
canonical minimum tableaus always
(a) get pivoted up-from east to north (b) get pivoted up-from north to east (c) get
pivoted up-from west to south (d) get pivoted up-from south to west
38. Unconstrained independent variables in noncanonical maximum tableaus
always
(a) get pivoted down-from north to east (b) get pivoted down-from south to west
(c) get pivoted down-from west to south (d) get pivoted down-from east to north
39. Unconstrained independent variables in noncanon- ical minimum tableaus
always
[Type here]
(a) get pivoted down from south to west (b) get pivoted down from west to south
(c) get pivoted down from north to east (d) get pivoted down from east to north
40. ”Any canonical tableau can be interpreted both as a canonical maximization
linear programming problem and a canonical minimization linear programming
problem.” The above statement is
(a) FALSE (b) TRUE (c) May be TRUE (d) May be FALSE
41. A tableau of a canonical slack minimization linear programming problem is
said to be minimum basic feasible if
(a) all c 0 j s < 0 (b) all c 0 j s ≥ 0. (c) all c 0 j s ≤ 0. (d) all c 0 j s > 0.
42. In Dual Simplex Algorithm for Minimum Tableaus, the minimization problem is
infeasible if
(a) cj > 0 such that j is maximal and a1j , a2j , ......amj ≤ 0. (b) cj > 0 such that j is
maximal or a1j , a2j , ......amj ≤ 0. (c) cj < 0 such that j is maximal and a1j , a2j ,
......amj ≤ 0. (d) cj < 0 such that j is maximal or a1j , a2j , ......amj ≤ 0.
43. ”In a minimum basic feasible tableau, the basic solution is a feasible solution”.
(a) FALSE (b) TRUE (c) May be TRUE (d) May be FALSE
44. In Dual Simplex Algorithm for Minimum Tableaus, the minimization problem is
unbounded if
(a) if bi < 0 and ai1, ai2, ...., ain ≤ 0 (b) if bi > 0 and ai1, ai2, ...., ain ≤ 0 (c) if if bi < 0
and ai1, ai2, ...., ain > 0 (d) if bi < 0 and ai1, ai2, ...., ain ≥ 0
45. If optimal solution exists in Dual Simplex Algorithm then
(a) Max f = -Min g (b) Max f = -Max g (c) Max f = -Min (-g) (d) Max f = -Max(-g)
46. For any pair of feasible solutions of dual canonical linear programming
problems, we have
(a)g > f (b) g ≥ f (c) g < f (d) g ≤ f
47. Choose ”The Duality Equation”
(a) g − f = SXt + Y tT (b) g + f = SXt + Y tT (c) g − f = SXt − Y tT (d) g + f = SXt − Y tT
48. For any pair of feasible solutions of dual canonical linear programming
problems, we have
(a)g − f > 0 (b) g − f < 0 (c) g − f ≤ 0 (d) g − f ≥ 0
49. Choose the correct statement
(a)If a canonical maximization linear programming problem is unbounded, then
the dual canonical minimization linear programming problem is unbounded (b)If a
canonical maximization linear programming problem is infeasible, then the dual
canonical minimization linear programming problem is infeasible. (c) If a canonical
maximization linear programming problem is unbounded, then the dual canonical
minimization linear programming problem is infeasible. (d)If a canonical
maximization linear programming problem is infeasible then the dual canonical
minimization linear programming problem is unbounded.
50. ”If a canonical maximization linear programming problem is infeasible then
the dual canonical minimization linear programming problem is
(a) Unbounded (b) Infeasible (c) Unbounded or Infeasible (d) None of the above