Q67561. 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
A 23 B 25 C 20 D 21
Show answer
Correct answer: 23
Q67562. If at least one of the basic variables is zero in a basic feasible solution of LPP, the solution is said to be:
A Optimal B Singular C Unbounded D Degenerate
Show answer
Correct answer: Degenerate
Q67563. In the simplex method, which variables are introduced to convert constraint conditions to equations?
A Feasible variables B Basic variables C Degenerate variables D Slack-variables
Show answer
Correct answer: Slack-variables
Q67564. 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
A J1, J2, J3, J5, J4 B J1, J3, J5, J2, J4 C J4, J3, J5, J2, J1 D J1, J3, J4, J2, J5
Show answer
Correct answer: J1, J3, J5, J2, J4
Q67565. Select the correct dual of below LPP: Maximize: z = 5x1 + 9x2 Subject to constraints: 2x1 + 5x2 ≥ 37 6x1 – 7x2 ≥ 56 x2, x1 ≥ 0
A Minimize: L = –37y1 – 56y2 Subject to: –2y1 – 6y2 ≥ 5 –5y1 + 7y2 ≥ 9 x2, x1 ≥ 0 B Minimize: L = –5y1 – 9y2 Subject to: 2y1 + 5y2 ≥ 37 6y1 – 7y2 ≥ 56 x2, x1 ≥ 0 C Minimize: L = 5y1 + 9y2 Subject to: 2y1 + 5y2 ≥ 56 6y1 – 7y1 ≥ 37 x2, x1 ≥ 0 D Minimize: L = 37y1 + 56y2 Subject to: 2y1 + 6y2 ≥ 5 5y1 – 7y2 ≥ 9 x2, x1 ≥ 0
Show answer
Correct answer: Minimize: L = –37y1 – 56y2 Subject to: –2y1 – 6y2 ≥ 5 –5y1 + 7y2 ≥ 9 x2, x1 ≥ 0
Q67566. 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:
A Infinite B 15 C 28 D 65
Show answer
Correct answer: Infinite
Q67567. An unbalanced assignment problem can be solved by converting into a balanced assignment problem by introducing dummy person or a dummy job with:
A Minimum Cost B Maximum Cost C Zero Cost D Mean Cost
Show answer
Correct answer: Zero Cost
Q67568. In VED classification to enhance the inventory control efficiency, alphabet D stands for:
A Demand B Desirable C Delivery D Decoupling
Show answer
Correct answer: Desirable
Q67569. EPQ model of inventory associates mainly with:
A Manufacturing environment B Price discounts C Larger consumption D Cheaper transportation
Show answer
Correct answer: Manufacturing environment
Q67570. A saddle point of a game is that place in the payoff matrix where:
A Minimum of the row maxima = minimum of the column maxima B Maximum of the row minima = maximum of the column minima C Maximum of the row minima = minimum of the column maxima D Minimum of the row maxima = maximum of the column minima
Show answer
Correct answer: Maximum of the row minima = minimum of the column maxima
Q67571. The function to be maximized (or minimized) in linear programming procedure is called:
A Target function B Optimized function C Subjective function D Objective function
Show answer
Correct answer: Objective function
Q67572. The main basic function of inventory is to:
A Increase the manufacturing B Increase the profitability C Increase the consumption D Construct the marketing support
Show answer
Correct answer: Increase the profitability
Q67573. If a standard problem and its dual are both feasible, then both are called:
A Bounded feasible B Dual feasible C Co-feasible D Optimum feasible
Show answer
Correct answer: Dual feasible
Q67574. Maximum of 5x + 2y + z for x,y, z ≥ 0 and x + 3y – z ≤ 6; y + z ≤ 4; 3x + y ≤ 7, comes from
A 7 x, y 1,z 3 3 B 1 x,y 3,z 0 3 C 2 x, y 3,z 1 3 D 7 x, y 0,z 4 3
Show answer
Correct answer: 7 x, y 1,z 3 3
Math Chapter Wise
Linear Programming Problems English
UPPSC Polytechnic Lecturer 2021(II)
Q67575. 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
A 5 → 1 → 3 → 2 → 4 → 6 B 3 → 1 → 5 → 6 → 2 → 4 C 1 → 3 → 6 → 2 → 4 → 5 D None of these
Show answer
Correct answer: 3 → 1 → 5 → 6 → 2 → 4
Math Chapter Wise
Linear Programming Problems English
UPPSC Polytechnic Lecturer 2021(II)
Q67576. The occurrence of degeneracy while solving a transportation problem means that
A total supply is equal to total demand B the solution so obtained is not feasible C the few allocation become negative D None of these
Show answer
Correct answer: the solution so obtained is not feasible
Math Chapter Wise
Linear Programming Problems English
UPPSC Polytechnic Lecturer 2021(II)
Q67577. Two person zero-sum game means that the
A and B Image/formula option B (see source) C Both D None of these
Show answer
Correct answer: and
Math Chapter Wise
Linear Programming Problems English
UPPSC Polytechnic Lecturer 2021(II)
Q67578. The degeneracy in the transportation problem indicates that -
A Dummy allocation(s) needs to be added B The multiple optimal solution exist C The problem has no feasible solution D (a) and (c) but not (b)
Show answer
Correct answer: The multiple optimal solution exist
Math Chapter Wise
Linear Programming Problems English
UPPSC Polytechnic Lecturer 2021(II)
Q67579. The solution to a transportation problem with m-rows (supplies) & n-columns (destination) is feasible of number of positive allocations are –
A m + n B m × n C m + n – 1 D None of these
Show answer
Correct answer: m + n – 1
Math Chapter Wise
Linear Programming Problems English
UPPSC Polytechnic Lecturer 2021(II)
Q67580. Let a salesman visits 'n' cities, then the number of possible routes are –
A n! B n – 1 C n D (n – 1)!
Show answer
Correct answer: (n – 1)!