Linear Programming, Optimize the Objective Function; How anyone can learn
When optimizing the objective function from a linear programming problem it is important to note what are the critical parts of the problem. The first is the constraints. These come in the form of linear inequalities. First you will want to graph each linear inequality and provide the shading to determine the feasible region. The feasible region is the region where all of your inequalities are true.(Where are the shading intersects) Once you have identified the boundary line you will need to identify the intersection of the linear inequalities that are bounded at the feasible region. These intersection points are called the vertices. Each Vertex will have an x and y coordinate. You will use these x and y coordinates to plug them into your objective function. Based on the problem you will either determine which vertex maximizes or minimizes your objective function.