Math Chapter Wise

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q41.The degeneracy in the transportation problem indicates that -

ADummy allocation(s) needs to be added BThe multiple optimal solution exist CThe problem has no feasible solution D(a) and (c) but not (b)

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q42.The solution to a transportation problem with m-rows (supplies) & n-columns (destination) is feasible of number of positive allocations are –

Am + n Bm × n Cm + n – 1 DNone of these

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q43.Let a salesman visits 'n' cities, then the number of possible routes are –

An! Bn – 1 Cn D(n – 1)!

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q44.If an opportunity cost value is used for an unused call to test optimality, it should be –

AEqual to zero BMost negative number CMost positive number DNone of these

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q45.The Hungarian method for solving an assignment problem can be used to solve –

Aa transportation problem Ba travelling salesman problem CBoth (a) and (b) DNone of these

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q46.When total supply is equal to total demand in a transportation problem, the problem is said to be -

ABalanced BUnbalanced CDegenerate DNone of these

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q47.If there are 'n' variables and 'm' inequalities in the primal linear programming problem, then the dual problem will contain –

A(m – 1) variables & (n–1) inequalities B(m+1) variables & (n+1) inequalities Cn variables and m inequalities Dm variables and n inequalities

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q48.The critical path of a network is

AThe longest time path BThe shortest time path CThe highest cost path DThe lowest cost path

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q49.The value of player A for the following payoff matrix is –

A4/3 B−4/3 C8/3 D−8/3

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q50.The extreme points of the set {(x, y): |x| ≤ 5, |y| ≤ 5} are -

A(5, 5), (–5, –5), (–5, 5), (5, –5) B(–5, 5), (0, 0), (0, –5), (–5, 0) C(5, 5), (0, 0), (0, 5), (5, 0) D(–5, –5), (5, 5), (0, –5), (5, 0)

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q51.Who is known as the father of Game Theory?

AJohnsons BHungarian CVogel DJ. Von Neumann

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q52.Maximum values of z = {min (3x1 – 10), min (- 5x1 + 5)} for 0 ≤ x1 ≤ 5 is -

A10 B0 C–10 DNone of these

Show answer

EnglishHaryana PGT 2018

Q53.What is the maximum value of P = 6x + 8y, when the condition are: 2x + y ≤ 30; x + 2y ≤ 24; x ≥ 0, y ≥ 0

A60 B120 C240 D305

Show answer

EnglishUKPSC GIC 2018

Q54.An L.P.P with m restrictions in n variables, the maximum number of basic feasible solutions

An/Cm+1 Bn+1/Cm+1 Cn/Cm Dn/Cm – 1

Show answer

EnglishUKPSC GIC 2018

Q55.An L.P.P. is given below max z = 3x1 + 2x2 such that x1 + x2 ≤ 4 x1 – x2 ≤ 2 x1, x2 ≥ 0 The solution of this L.P.P. is

Ax1 = 1, x2 = 4 Bx1 = 3, x2 = 0 Cx1 = 2, x2 = 2 Dx1 = 3, x2 = 1

Show answer

EnglishUKPSC GIC 2018

Q56.Which of the following condition is/are used in simplex method?

Aor BImage/formula option B (see source) CBoth DEither

Show answer

EnglishUKPSC Lecturer (Mains) 2020

Q57.The feasible region for the linear programming problem. Maximize z = 9x1 + 7x2 Subject to x1 + 2x2 ≥ 7 x1 – x2 ≤4 and x1, x2≥ 0 is:

AUnbounded BBounded CClosed DNone of these

Show answer

EnglishUKPSC Lecturer (Mains) 2020

Q58.Suppose the Linear Programming problem. Minimize z = 2x1 + x2 Subject to x1 + x2≥ 1 x1 + 2x2≤10 x2 ≤4 and x1, x2≥ 0 is:

A1 B2 C3 D4

Show answer

EnglishUKPSC Lecturer (Mains) 2020

Q59.If there is no feasible region for a Linear Programming Problem, then the problem has/have

AInfinite solutions BNo solutions CUnbounded solutions DA unique solution

Show answer

EnglishUKPSC Lecturer (Mains) 2020

Q60.The LPP: Max. x1+ 5 2 x2 subject to 5x1 + 3x2≤15 –x1+x2 ≤1 2x1+5x2≤10 and x1, x2≥ 0 has:

ANo feasible solution BInfinitely many optimal solutions CA unique optimal solution DAn unbounded solution

Show answer