Ot MCQ 3
Ot MCQ 3
(Linear Programming)
1.In an Linear programming problem, the restrictions or limitations under which the
objective
1. Constraints
2. Objective function
2. Hungarian method
3.In a transportation problem with 4 supply points and 5 demand points, how many
number
1. 20
2. 1
3. 0
4. 9
4.Important Points to remember:-
Number of constraints = m + n
Number of variables = m × n
Number of equations = m + n – 1
5.If the ith constraint of a primal (maximisation) is equality, then the dual
(minimisation)
1. ≥ 0
2. ≤ 0
3. Unrestricted in sign
1. Assignment problem
2. Inventory problem
3 Transportation problem
4. PERT
7.In the Simplex method if in pivot column all the entries are negative or zero when
choosing
1. Solution is Degenerate
2. Solution is infeasible
3. Alternative optima
4. Unbounded
A. first quadrant
B. second quadrant
C. third quadrant
D. fourth quadrant
A. a constraint
B. function to be optimised
D. None of these
10: The linear inequalities or equations or restrictions on the variables of a linear
programming problem are called:
A. a constraint
B. Decision variables
C. Objective function
11: A set of values of decision variables that satisfies the linear constraints and non-
negativity conditions of an L.P.P. is called its:
A. Unbounded solution
B. Optimum solution
C. Feasible solution
D. None of these
A. 12
B. 14
C. 16
A. on X-axis
B. on Y-axis
D. none of these
A. Manufacturing problem
B. Diet problem
C. Transportation problems
16. The optimal value of the objective function is attained at the points
(a) given by intersection of lines representing inequations with axes only
(b) given by intersection of lines representing inequations with X-axis only
(c) given by corner points of the feasible region
(d) at the origin
17. Which of the following statements is correct ?
(a) Every LP problem has at least one optimal solution.
(b) Every LP problem has a unique solution.
(c) If an LP problem has two optimal solutions, then it has infinitely many solutions.
(d) If a feasible region is unbounded then LP problem has no solution
22. The corner points of the feasible region determined by the system of
linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Suppose z = px + 3y,
where p > 0. If the maximum of z occurs at both the points (15, 15) and (0, 20), then p = _____ .
(a) 4
(b) 5
(c) 1
(d) 2
23. The position of points O (0, 0) and P (2, -3) in the region of graph of
inequation 2x - 3y < 5 will be _____ .
(a) O inside and P outside
(b) O and P both inside
(c) O and P both outside
(d) O outside and P inside
(a) it helps in converting the verbal description and numerical data into mathematical expression
(b) decision-makers prefer to work with formal models
(c) it captures the relevant relationship among decision factors
(d) it enables the use of algebraic technique
25.Linear programming is a
(a) it helps in converting the verbal description and numerical data into a mathematical expression
(b) decision-makers prefer to work with formal models
(c) it captures the relevant relationship among decision factors
(d) it enables the use of algebraic technique
(a) National emergency Combined efforts of talents of all fields Economics and Engineering
(b) Political problems
(c) Combined efforts of talents of all fields
(d) Economics and Engineering
36.The name of the subject Operations Research is due to the fact that
(a) Bellman
(b) Newman
(c) McClosky and Trefrhen
(d) None of these
(a) Add the elements of the key row to the key number
(b) Subtract the elements of a key row from topmost no key row
(c) Divide the elements of the key row by the key number
(d) None of these
47.When all the elements of replacement ratio column are equal, the
situation is known as
(a) Tie,
(b) Degeneracy
(c) Break
(d) None of these