Identify the vertices of the feasible region for the given linear programming constraints.
1 answer:
The vertices of the feasible region are as follows,
(-14, -11), (9, -11) and (6, 4)
What is a Feasible Region?
The area of the graph where all constraints are satisfied is the feasible solution zone or feasible region. It might also be thought of as the point where each constraint line's valid regions intersect. Any decision in this region would lead to a workable resolution for our objective function.
Vertices of the Feasible Region
As it can be seen in the graph, the vertices of the feasible region surrounded by the given constraints are:
(-14, -11), (9, -11) and (6, 4)
Learn more about feasible region here:
#SPJ1
You might be interested in
Answer:
(-√(6-√26) < x < √(6-√26)) ∪ (x < -√(6 +√26)) ∪ (√(6 +√26) < x)
Step-by-step explanation:
Using x^2 = z, the equation can be rewritten as ...
z^2 -12z +10 > 0
(z -6)^2 -26 > 0
|z -6| > √26
This resolves to two equations.
This one ...
x^2 -6 < -√26 . . . . substitute x^2 for z
|x| < √(6-√26) . . . . add 6, take the square root; use √a^2 = |a|
-√(6-√26) < x < √(6-√26)
__
and this one ...
x^2 -6 > √26
|x| > √(6 +√26)
x < -√(6 +√26) ∪ √(6 +√26) < x
