Math Chapter Wise

EnglishJSSC PGT 2018

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

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

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

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

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

ADemand BDesirable CDelivery DDecoupling

Show answer

EnglishOPSC PGT 2017

Q7246.EPQ model of inventory associates mainly with:

AManufacturing environment BPrice discounts CLarger consumption DCheaper transportation

Show answer

EnglishOPSC PGT 2017

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

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

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

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

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

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

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

Q7254.Two person zero-sum game means that the

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

Show answer

EnglishUPPSC Polytechnic Lecturer 2021(II)

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

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

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

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

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

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