Math Chapter Wise question with answer

Q01 The dual of the linear programming problem: Minimize CT x subject to Ax ≥ b and x ≥ 0 is English · Bihar (TRE 1.0) -2023 Q02 If the corner points of the LPP, Z = 13x - 15y subject to the constraints x + y ≤7, 2x - 3y ≥ 0, x ≥ 0 and y ≥ 0 ar... English · KVS PGT 2023 Q03 Below matrix gives the transportation cost of sending material from 3 depots to 5 final destinations. The storage c... English · JSSC PGT 2018 Q04 In a toy factory, Machine A Manufactures the toys and Machine B polishes and packs them. For 5 such jobs select the... English · JSSC PGT 2018 Q05 In VED classification to enhance the inventory control efficiency, alphabet D stands for: English · OPSC PGT 2017 Q06 If a standard problem and its dual are both feasible, then both are called: English · OPSC PGT 2017