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 The objective function of the dual problem of the following primal problem is – Max (z) = 3x1 – 3x2 s.t. x1≤4 x2≤6... English · RPSC PGT 2022 Q03 Select the correct dual of below LPP: Maximize: z = 5x1 + 9x2 Subject to constraints: 2x1 + 5x2 ≥ 37 6x1 – 7x2 ≥ 56... English · JSSC PGT 2018 Q04 If a standard problem and its dual are both feasible, then both are called: English · OPSC PGT 2017 Q05 If there are 'n' variables and 'm' inequalities in the primal linear programming problem, then the dual problem wil... English · UPPSC Polytechnic Lecturer 2021(II) Q06 In the simplex method, which variables are introduced to convert constraint conditions to equations? English · JSSC PGT 2018