CUET Preparation Today
| Let \(R\) be the feasible region for a linear programming problem, and let \(z=ax+by\) be the objective function. Which of the following is true. |
If \(R\) is bounded then the objective function has a maximum and may not have a minimum value on \(R\). If \(R\) is bounded then the objective function neither have a maximum and nor minimum value on \(R\). If \(R\) is unbounded then the objective function has a maximum and a value on \(R\). None of these |
| None of these |
| \(R\) bounded implies both maximum and minimum value on \(R\). |
