In a graphical solution of a two-variable linear programming problem, what does the common area satisfying all constraints represent?
Correct answer: A. The feasible region
- A. The feasible region
- B. The objective function line
- C. The sensitivity interval
- D. The infeasibility boundary
Explanation
The common area satisfying every constraint and sign restriction is called the feasible region. An objective function line is moved across this region to locate the best feasible value.
Report an error
The more specific you are, the faster it gets fixed. A source beats an opinion.
Prefer email? support@testustad.com
Practise Linear Programming
30 free Linear Programming MCQs from Quantitative Methods, each with the correct answer and an explanation. Unlimited attempts, no account needed.
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
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?
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?
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?
A constraint is binding at a particular solution when it: