Feasible Region

Q.

Define feasible region.

Q.

The common region determined by all the constraints including non-negative constraints x, y ≥ 0 of a linear programming problem is called the ……...

1. Simple region

2. Feasible region

3. Infeasible region

4. Bounded region

Q.

Shape of the feasible region formed by the following constraints is

X + y ≤ 2, x + y ≥ 5, x ≥ 0, y ≥ 0

1. Unbounded solution

2. Triangular region

3. Trapezium

4. No feasible region

Q.

What is a feasible region?

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

1. Feasible region
2. Objective function
3. Decision region
4. Optimal solution

Q.

Shape of the feasible region formed by the following constraints is

2x + 3y ≥ 6, 2x + 3y ≤ 12, x ≥ 0, y ≥ 0

1. Unbounded solution

2. No feasible region

3. Triangular region

4. Trapezium

Q. There are two types of fertilisers $F_1$ and $F_2$. $F_1$ consists of $10\%$ nitrogen and $6\%$ phosphoric acid, $F_2$ consists of $5\%$ nitrogen and $10\%$ phosphoric acid. After testing the soil conditions, a farmer finds that she needs at least $14\text{kg}$ of nitrogen and $14\text{kg}$ of phosphoric acid for her crop. If $F_1$ costs Rs $6/\text{kg}$ and $F_2$ costs Rs $5/\text{kg}$, then the minimum cost of mixture which will produce the required nutrients is

Q.

Find the area under the given curves and given lines:

(i) y = x², x = 1, x = 2 and x-axis

(ii) y = x⁴, x = 1, x = 5 and x –axis

Q.

Shape of feasible region formed by following constraints is 4x + y ≥ 20, 2x + 3y ≥ 30, x, y, ≥ 0.

1. Triangular region

2. No feasible region

3. Unbounded region and shape is not fixed

4. Trapezium

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

1. Feasible region

2. Objective function

3. Decision region

4. Optimal solution

Q. The constraints x + y ≤ 4, x ≥ 0 and y ≥ 0 gives an unbounded feasible region for the linear programming problem with the same constraints

1. False
2. True

Q. Sketch the graph of y = $\sqrt{x+1}$ in [0, 4] and determine the area of the region enclosed by the curve, the x-axis and the lines x = 0, x = 4.

Q. Find the area of the region bounded by the parabola y² = 4ax and the line x = a.

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

1. Feasible region

2. Objective function

3. Decision region

4. Optimal solution

Q. The common region determined by all the constraints including the non-negative constraints x ≥ 0 and y ≥ 0 of a linear programming problem is called

1. Feasible region

2. Objective function

3. Decision region

4. Optimal solution

Q. The constraints x + y ≤ 4, x ≥ 0 and y ≥ 0 gives an unbounded feasible region for the linear programming problem with the same constraints

1. True
2. False