Linear programming how to optimize the objective function

The video tutorial covers the process of graphing linear inequalities and identifying feasible regions. It begins with an introduction to the objective equation and emphasizes the importance of rewriting inequalities in slope-intercept form. Common student mistakes in graphing are discussed, followed by techniques for shading and identifying feasible regions. The tutorial also explains how to maximize the objective function by evaluating vertices. Finally, tips for using graphing technology to improve accuracy are provided.

What are the vertices of the feasible region as mentioned in the text?

How do you determine which coordinate point gives the maximum value in the objective function?

What should you do if the vertices are in between integers when graphing?