Which statement best distinguishes a feasible solution from a basic feasible solution?
Correct answer: A. A basic feasible solution lies at a corner of the feasible region
- A. A basic feasible solution lies at a corner of the feasible region
- B. A feasible solution must maximize the objective function
- C. A basic feasible solution violates no non-negativity condition
- D. A feasible solution must contain only integer variables
Explanation
A basic feasible solution satisfies all constraints and is formed by setting suitable non-basic variables to zero, usually placing it at a corner point. A general feasible solution can lie anywhere within the feasible region and need not be a corner.
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 the simplex method for a maximization problem, which variable usually enters the basis?
For a constraint of the form 4x + 3y ≥ 12, which variable is normally subtracted to obtain an equality?
What is the main purpose of introducing an artificial variable in the simplex method?
If a primal maximization problem and its dual minimization problem are both feasible, which relationship must hold for any feasible pair of solutions?
In sensitivity analysis, what does the allowable increase of an objective coefficient indicate?
A company produces products A and B. Product A earns Rs. 30 and uses 2 labour hours, while product B earns Rs. 20 and uses 1 labour hour. If at most 100 labour hours are available, which objective function represents profit maximization?