Math Chapter Wise

EnglishDSSSB PGT 2021

Q21.The pay-off matrix for a strictly determinable game is– The value of b is–

A–1 ≤ b ≤ 2 B0 ≤ b ≤ 2 C–2 ≤ b ≤ 2 D–8 ≤ b ≤ 5

Show answer

EnglishDSSSB PGT 2021

Q22.Which one of the following is not a non- degenerate basic solution in a system of 2 equations with 4 unknowns?

A(10, – 42, 0, 0) B(0, 22, – 43, 0) C(0, 0, – 8, 0) D(7, 0, – 9, 0)

Show answer

EnglishJSSC PGT 2018

Q23.A solution to linear programming problem that satisfies all the constraints, except the non- negativity constraint, is referred to as:

AFeasible solution BBasic solution COptimal solution DBasic feasible solution

Show answer

EnglishJSSC PGT 2018

Q24.Below matrix gives the transportation cost of sending material from 3 depots to 5 final destinations. The storage capacity of the depots and the receiving capacity of final destination shops (represented as S1, S2,...) is also given. Find the minimal transportation cost satisfying the constraints on storage depots and receiver shops. S1 S2 S3 S4 S5 Dep A 3 6 1 1 1 4 Dep B 2 4 3 2 7 5 Dep C 1 1 2 1 2 6 2 2 3 4 4

A23 B25 C20 D21

Show answer

EnglishJSSC PGT 2018

Q25.If at least one of the basic variables is zero in a basic feasible solution of LPP, the solution is said to be:

AOptimal BSingular CUnbounded DDegenerate

Show answer

EnglishJSSC PGT 2018

Q26.In the simplex method, which variables are introduced to convert constraint conditions to equations?

AFeasible variables BBasic variables CDegenerate variables DSlack-variables

Show answer

EnglishJSSC PGT 2018

Q27.In a toy factory, Machine A Manufactures the toys and Machine B polishes and packs them. For 5 such jobs select the optimal sequence of jobs so that the total time taken to complete all the jobs is minimum. Jobs J1 J2 J3 J4 J5 M. A 4 13 7 11 9 M. B 9 11 8 6 12

AJ1, J2, J3, J5, J4 BJ1, J3, J5, J2, J4 CJ4, J3, J5, J2, J1 DJ1, J3, J4, J2, J5

Show answer

EnglishJSSC PGT 2018

Q28.Select the correct dual of below LPP: Maximize: z = 5x1 + 9x2 Subject to constraints: 2x1 + 5x2 ≥ 37 6x1 – 7x2 ≥ 56 x2, x1 ≥ 0

AMinimize: L = –37y1 – 56y2 Subject to: –2y1 – 6y2 ≥ 5 –5y1 + 7y2 ≥ 9 x2, x1 ≥ 0 BMinimize: L = –5y1 – 9y2 Subject to: 2y1 + 5y2 ≥ 37 6y1 – 7y2 ≥ 56 x2, x1 ≥ 0 CMinimize: L = 5y1 + 9y2 Subject to: 2y1 + 5y2 ≥ 56 6y1 – 7y1 ≥ 37 x2, x1 ≥ 0 DMinimize: L = 37y1 + 56y2 Subject to: 2y1 + 6y2 ≥ 5 5y1 – 7y2 ≥ 9 x2, x1 ≥ 0

Show answer

EnglishOPSC PGT 2017

Q29.Maximum value of 1 2 2x 3x subject to the conditions 1 2 1 2 1 2 x,x 0,x x 1,x x 3is:

AInfinite B15 C28 D65

Show answer

EnglishOPSC PGT 2017

Q30.An unbalanced assignment problem can be solved by converting into a balanced assignment problem by introducing dummy person or a dummy job with:

AMinimum Cost BMaximum Cost CZero Cost DMean Cost

Show answer

EnglishOPSC PGT 2017

Q31.In VED classification to enhance the inventory control efficiency, alphabet D stands for:

ADemand BDesirable CDelivery DDecoupling

Show answer

EnglishOPSC PGT 2017

Q32.EPQ model of inventory associates mainly with:

AManufacturing environment BPrice discounts CLarger consumption DCheaper transportation

Show answer

EnglishOPSC PGT 2017

Q33.A saddle point of a game is that place in the payoff matrix where:

AMinimum of the row maxima = minimum of the column maxima BMaximum of the row minima = maximum of the column minima CMaximum of the row minima = minimum of the column maxima DMinimum of the row maxima = maximum of the column minima

Show answer

EnglishOPSC PGT 2017

Q34.The function to be maximized (or minimized) in linear programming procedure is called:

ATarget function BOptimized function CSubjective function DObjective function

Show answer

EnglishOPSC PGT 2017

Q35.The main basic function of inventory is to:

AIncrease the manufacturing BIncrease the profitability CIncrease the consumption DConstruct the marketing support

Show answer

EnglishOPSC PGT 2017

Q36.If a standard problem and its dual are both feasible, then both are called:

ABounded feasible BDual feasible CCo-feasible DOptimum feasible

Show answer

EnglishOPSC PGT 2017

Q37.Maximum of 5x + 2y + z for x,y, z ≥ 0 and x + 3y – z ≤ 6; y + z ≤ 4; 3x + y ≤ 7, comes from

A7 x, y 1,z 3 3 B1 x,y 3,z 0 3 C2 x, y 3,z 1 3 D7 x, y 0,z 4 3

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q38.The sequence that minimizes the total elapsed time required to complete the following jobs is Processing times in hours No. of Jobs: 1 2 3 4 5 6 Machine A: 4 8 3 6 7 5 Machine B: 6 3 7 2 8 4

A5 → 1 → 3 → 2 → 4 → 6 B3 → 1 → 5 → 6 → 2 → 4 C1 → 3 → 6 → 2 → 4 → 5 DNone of these

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q39.The occurrence of degeneracy while solving a transportation problem means that

Atotal supply is equal to total demand Bthe solution so obtained is not feasible Cthe few allocation become negative DNone of these

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

Q40.Two person zero-sum game means that the

Aand BImage/formula option B (see source) CBoth DNone of these

Show answer