Respuesta :

Matheng

Answer:

Option 4 : [tex](0.\frac{3}{2} ) \ , \ (0,2) \ , \ (6,0) \ , \ (\frac{9}{4} ,0)[/tex]

Step-by-step explanation:

See the attached figure:

To find the vertices of the feasible region, we need to graph the constraints, then find the area included by them, then calculate the vertices which is the intersection between each two of them.

As shown, the shaded area represents the solution of the constraints

So, the vertices of the feasible region are:

[tex](0.\frac{3}{2} ) \ , \ (0,2) \ , \ (6,0) \ , \ (\frac{9}{4} ,0)[/tex]

Ver imagen Matheng
MrRoyal

The vertices of the feasible regions are [tex](0,\frac 32), \ (0,2)\ (6,0)\ and\ (\frac 94,0)[/tex]

What are constraints?

The constraints of a linear programming model are the set of inequalities that bound the model

The constraints are given as:

[tex]x + 3y \le 6[/tex]

[tex]4x + 6y \ge 9[/tex]

[tex]x,y \ge 0[/tex]

Start by plotting the graphs of the constraints (see attachment for graph).

From the attached graph, the feasible regions are

[tex](0,\frac 32), \ (0,2)\ (6,0)\ and\ (\frac 94,0)[/tex]

Hence, option (d) is true

Read more about constraints at:

https://brainly.com/question/16826001

Ver imagen MrRoyal

Otras preguntas