Students write an objective function and graph the system of inequalities to find the maximum profit from selling two types of game players.
Students will solve a manufacturing problem using a system of linear inequalities in a linear programming model. After reading the company information, students will find the profit objective function for a company that makes different types of game players.
Next, students will identify all the constraints in the problem, including assembly time, testing time, and non-negative restrictions. Students will use this information to graph all of the inequalities that represent the constraints.
Students will identify all of the vertices of the feasible region and evaluate each of the points to find the maximum profit possible under the given constraints.
© Copyright 1995-2018 Texas Instruments Incorporated. All rights reserved.