PRC-2 · Chapter 4 · Question 27 of 60
If a linear programming model contains mathematical constraints that severely contradict each other, resulting in absolutely no overlapping shaded area, the problem is considered:
Test yourself: pick an answer
Reveal answer & explanation
Correct answer: B) Infeasible
Explanation
An 'infeasible' problem occurs when there is no possible combination of values that can satisfy all the given constraints simultaneously, meaning a feasible region simply does not exist.
More Linear Programming MCQs
- Q29A workshop uses 3 machine hours to produce one unit of Alpha (x) and 4 machine hours for Beta (y). The total machine hours available per…
- Q30A government contract requires a supplier to deliver a minimum combined total of 500 units of medical kits (x) and hygiene kits (y). Which…
- Q31A loan of Rs. 1,000,000 is to be repaid over 10 years at a 12% annual interest rate. The repayment schedule follows an 'equated monthly…
- Q32What is the primary mathematical difference between 'Simple Interest' and 'Compound Interest'?
- Q33If a bank offers an annual nominal rate of 10% compounded 'quarterly', how many times (m) per year is interest added to the principal?