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
Consider the function This function has:
- the domain
- the range
If the domain of unknown function is then
or
This means that you have
as a part of needed function.
If the range of unknown function is then
This means that you have to translate function b units up and then the expression of the function is
Answer: correct choice is B.
Answer:
7.5 m 457.5
Step-by-step explanation:
First, visualize the original cone and the smaller cone as overlapping similar triangles. The scale factor of the original cone to the smaller cone is 50:40, so if the smaller cone has a radius of 6 m, then the radius of the original cone would be 7.5 m.
The volume of the frustum is the volume of the original cone minus the volume of the smaller cone. The formula for the volume of a cone is V = .
Original Cone = =
= 937.5
Smaller Cone = =
= 480
Frustum = 937.5 - 480
= 457.5