Find the exact question you need.

Math Chapter Wise Linear Programming Problems English UPPSC Polytechnic Lecturer 2021(II)

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

Math Chapter Wise Linear Programming Problems English UPPSC Polytechnic Lecturer 2021(II)

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

Math Chapter Wise Linear Programming Problems English UPPSC Polytechnic Lecturer 2021(II)

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

Math Chapter Wise Linear Programming Problems English UPPSC Polytechnic Lecturer 2021(II)

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

Math Chapter Wise Linear Programming Problems English UPPSC Polytechnic Lecturer 2021(II)

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

Math Chapter Wise Linear Programming Problems English UPPSC Polytechnic Lecturer 2021(II)

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

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

Show answer

Math Chapter Wise Linear Programming Problems English UPPSC Polytechnic Lecturer 2021(II)

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

Math Chapter Wise Linear Programming Problems English UPPSC Polytechnic Lecturer 2021(II)

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

AJohnsons BHungarian CVogel DJ. Von Neumann

Show answer

Math Chapter Wise Linear Programming Problems English UPPSC Polytechnic Lecturer 2021(II)

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

A10 B0 C–10 DNone of these

Show answer

Math Chapter Wise Linear Programming Problems English Haryana PGT 2018

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

Math Chapter Wise Linear Programming Problems English UKPSC GIC 2018

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

Math Chapter Wise Linear Programming Problems English UKPSC GIC 2018

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

Math Chapter Wise Linear Programming Problems English UKPSC GIC 2018

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

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

Show answer

Math Chapter Wise Linear Programming Problems English UKPSC Lecturer (Mains) 2020

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

Math Chapter Wise Linear Programming Problems English UKPSC Lecturer (Mains) 2020

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

Math Chapter Wise Linear Programming Problems English UKPSC Lecturer (Mains) 2020

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

Math Chapter Wise Linear Programming Problems English UKPSC Lecturer (Mains) 2020

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

Math Chapter Wise Linear Programming Problems English UKPSC Lecturer (Mains) 2020

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

Math Chapter Wise Linear Programming Problems English Rajasthan TGT 2016

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

Math Chapter Wise Linear Programming Problems English Rajasthan TGT 2016

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