If the primal linear programming problem is a maximization problem with less-than-or-equal constraints and non-negative variables, what is the usual form of its dual?
Correct answer: B. A minimization problem with greater-than-or-equal constraints
- A. A maximization problem with equal constraints only
- B. A minimization problem with greater-than-or-equal constraints
- C. A minimization problem with less-than-or-equal constraints
- D. A feasibility problem with no objective function
Explanation
The standard dual of a primal maximization problem with ≤ constraints is a minimization problem with ≥ constraints. The primal variables correspond to dual constraints, and the primal constraints correspond to dual variables.
Report an error
The more specific you are, the faster it gets fixed. A source beats an opinion.
Prefer email? [email protected]
About Linear Programming
Linear programming models the maximum or minimum of an objective function subject to linear constraints. Questions involve translating word conditions into inequalities, drawing the feasible region, identifying corner points and evaluating the objective function, including cases involving non-negativity restrictions and redundant constraints.
Practise Linear Programming
30 free Linear Programming MCQs from Quantitative Methods, each with the correct answer and an explanation. Unlimited attempts, no account needed.
Discussion
Stuck on an option, or know a faster way to get there? Ask or explain it here.
No comments yet. Be the first to explain this one.
Exams that ask Quantitative Methods questions like this
Quantitative Methods is on this paper prepared for on TestUstad, and all of them draw the same bank, so this question is worth knowing for it.
More Linear Programming questions
Which assumption of linear programming means that the contribution of each activity is directly proportional to its level?
Which pair of constraints makes a linear programming problem infeasible?
What is the purpose of adding a slack variable to a constraint such as 2x + 3y ≤ 12?
In a graphical solution of a two-variable linear programming problem, what does the common area satisfying all constraints represent?
A basic feasible solution is called degenerate when which condition occurs?
In linear programming, how is a constraint such as 3x + 2y ≥ 10 usually converted into an equality?