Question

Question No. 1
In L P P the Non negativity constraints on variables restricts
the feasible, region to --- of XY plane
First quadrant& Second
quadrant
Second
quadrant
First quadrant & fourth
quadrant
Save & Next

Answer 1

Answer:

Rockstar games baba gaming

Step-by-step explanation:

gjbk doi tu uhf 100top up

Answer 2

Answer:

⇒the correct answer is only first quadrant.

⇒the options of question are clumsy and incomplete info, i will provide complete question below after explanation check it out!

Step-by-step explanation:

• A feasible region is an area defined by a set of coordinates that satisfy a system of inequalities.
• The region satisfies all restrictions imposed by a linear programming scenario
• . The concept is an optimization technique.
• To solve the given linear programming problem, linear inequalities are drawn on graphs and the inequality (≤,≥) tells us the region, which particular linear inequality will cover.
• When all linear inequalities are drawn on a graph, the common region for all of them represents a feasible region.

Qestion:

In L.P.P the Non negativity constraints on variables restricts

the feasible, region to --- of XY plane.

(a)  first and second quadrant.                        (b) first and third quadran.

(c) second quadrant                                          (d) only first quadrant