Which condition is required for a feasible solution in a linear programming problem?
Correct answer: C. It satisfies every constraint and sign restriction
- A. It occurs only at the origin of the graph
- B. It gives the largest possible value of the objective
- C. It satisfies every constraint and sign restriction
- D. It contains equal values for all decision variables
Explanation
A feasible solution satisfies all constraints, including non-negativity or other sign restrictions. It does not have to be optimal, because many feasible solutions may exist.
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
In a linear programming problem, what does the objective function represent?
For a linear programming problem with a non-empty bounded feasible region, where does an optimal solution occur if one exists?
A manufacturer maximizes Z = 3x + 2y subject to x + y ≤ 4, x ≤ 2, y ≤ 3, and x, y ≥ 0. What is the maximum value of Z?
What is the purpose of adding a slack variable to a constraint such as 2x + 3y ≤ 12?
Which pair of constraints makes a linear programming problem infeasible?