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 A solution to linear programming problem that satisfies all the constraints, except the non- negativity constraint,... English · JSSC PGT 2018 Q03 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) Q04 The feasible region for the linear programming problem. Maximize z = 9x1 + 7x2 Subject to x1 + 2x2 ≥ 7 x1 – x2 ≤4 a... English · UKPSC Lecturer (Mains) 2020 Q05 Suppose the Linear Programming problem. Minimize z = 2x1 + x2 Subject to x1 + x2≥ 1 x1 + 2x2≤10 x2 ≤4 and x1, x2≥ 0... English · UKPSC Lecturer (Mains) 2020 Q06 If there is no feasible region for a Linear Programming Problem, then the problem has/have English · UKPSC Lecturer (Mains) 2020