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
The table for the complete ratios between distance and time is shown below.
<h3>What is the Ratio of Distance to Time?</h3>The ratio of distance to time, given that 280 miles will be covered in 4 hours is: 280/4 = 70 miles per hour.
Thus, for 2 hours: 2(70) = 140 miles distance.
For 350 miles, we would have: 350/70 = 5 hours time.
For 6 hours: 6(70) = 420 miles distance.
For 8 hours: 8(70) = 560 miles distance.
For 700 miles, we would have: 700/70 = 7 hours time.
The complete table is shown in the image below.
Learn more about ratios on:
#SPJ1
