Home › CBSE Class 12 (Commerce) › Mathematics › Linear Programming › A primal maximises cTx with Ax ≤ b, x ≥ 0. What …
A primal maximises cTx with Ax ≤ b, x ≥ 0. What bound does its dual give?
AA lower bound on the primal
BAn upper bound on the primal
CA copy of the primal
DA bound equal to zero
Answer & Solution
Correct answer: B. An upper bound on the primal
Any feasible dual solution bounds the primal maximum from above.
Related questions
The word linear in L.P.P. means the variables in every function have index at most what?For the constraints 2x + y ≤ 8, x + 2y ≤ 8, x ≥ 0, y ≥ 0, which point is a feasible solutiThe feasible region of an L.P.P. has vertices (0,0), (4,0), (2,3) and (0,4). What is the mIn the corner point method, what follows finding the vertices?Which two methods are named for solving an L.P.P., of which only one is studied here?By the convex polygon theorem, the optimum of z occurs where?What type of set is the set of all feasible solutions of an L.P.P.?A feasible solution that gives the maximum or minimum value of z as required is called wha