DM.11 Linear programming models an optimization process. The student will use problem solving, mathematical communication, mathematical reasoning, connections, and representations to A linear programming model consists of a system of constraints and an objective quantity that can be maximized or minimized. Model practical problems with systems of linear inequalities. Any maximum or minimum value for a system of inequalities will Identify the feasibility region of a system of linear inequalities with occur at a corner point of a feasible region. no more than four constraints. Identify the coordinates of the corner points of a feasibility region. Determine the maximum or minimum value of the system. Describe the meaning of the maximum or minimum value in terms of the original problem.
DM.11 Linear programming models an optimization process. A linear programming model consists of a system of constraints and an objective quantity that can be maximized or minimized. Any maximum or minimum value for a system of inequalities will occur at a corner point of a feasible region. The student will use problem solving, mathematical communication, mathematical reasoning, connections, and representations to Model practical problems with systems of linear inequalities. Identify the feasibility region of a system of linear inequalities with no more than four constraints. Identify the coordinates of the corner points of a feasibility region. Determine the maximum or minimum value of the system. Describe the meaning of the maximum or minimum value in terms of the original problem.
discretemath-cf.docx