Objective Function Shortcut '1 The Fundamental Theorem of Linear Programming states that the maximum and minimum values of the objective function lie on one of the vertices. However, for a system with many constraints, there can be many vertices to check. What principles, theorems, or tricks can you think of or find to simplify the process of testing all the vertices? If possible, make a graph and display it in your post (do not simply attach it). If you draw a blank orjoin the discussion after this above question is thoroughly explored, try one or both of the following suggestions: 1. Review the samples and ideas already posted. Check them for accuracy and ask other students any questions you have about the material they have posted. 2. Describe some aspect of your own life in which you would like to maximize something but are limited by constraints. Can your objective and constraints be linearly modeled? Can you formulate a linear programming solution