Math Chapter Wise

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q7261.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)

Q7262.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)

Q7263.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)

Q7264.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)

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

AJohnsons BHungarian CVogel DJ. Von Neumann

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q7266.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

Q7267.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

Q7268.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

Q7269.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

Q7270.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

Q7271.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

Q7272.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

Q7273.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

Q7274.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

EnglishUKPSC Lecturer (Mains) 2020

Q7275.Dual simplex method is applicable to those Linear programming Problems that start with

Aan arbitrary in feasible solution Ban infeasible but optimal solution Ca feasible solution Da feasible and optimal solution

Show answer

EnglishRajasthan TGT 2016

Q7276.To solve the following LPP by simplex method how many artificial variable/s will be added? min z = 5x1+2x2 s.t. 3x1 + x2 = 4 x1 + 2x2 ≤3 2x1 + x2 ≥ 3, x1, x2 ≤ 0

A4 B3 C2 D1

Show answer

EnglishRajasthan TGT 2016

Q7277.The linear programming problem z = 5x + 7y subject to the constraints x + y≤ 6; 2x + 3y ≥ 3; x ≥ 3, y≥3, then z is

AAlways minimum BAlways maximum CEither minimum or maximum DInfinite

Show answer

EnglishRajasthan TGT 2016

Q7278.In an assignment problem, if all ij c 0 ≥, then xij = Xij will be an optimal solution where

Aij ij i j c X 1 = ∑∑ Bij i c 1 = ∑ Cij i j c 0 = ∑∑ Dij ij i j c X 0 = ∑∑

Show answer

EnglishUKPSC Lecturer (Mains) 2020

Q7279.For the system of linear equations: x1 + 2x2 + x3 = 4 2x1 + x2 + 5x3 = 5 Which one is not true?

Ax1 = 2, x2 = 1, x3 = 0 Bx1 = 5, x2 = 0, x3 = -1 Cx1 = 0, x2 = 5/3, x3 = 2/3 Dx1 = 0, x2 = 2, x3 = 1

Show answer