(CCSS) Objectives: Tennessee Finite Math Textbook Writing in Math Conceptual Category: Reasoning with Students will: 7-3 Graphical Solution of Linear Programming Determine whether the following is sometimes, Equations and Inequalities always, or never true. Explain your reasoning. Solve linear programming problems in Domain: Represent and solve equations and An unbounded region will not have both a two variables Additional Resources inequalities graphically. maximum and a minimum value. Graph the solutions to a linear inequality in two variables Task(s) Chapter 10 Linear Programming: The Simplex Method (Allow approximately 2 weeks for instruction, review, and assessment) Conceptual Category: Algebra Enduring Understanding(s): Tennessee Finite Math Textbook Important Terms & Concepts (Chapter 10) Domain: Linear programming A linear model can be used to represent 10-1 Standard Maximum Problems, Slack Basic solution, decision variables, departing variable, dual of an SMP, Dual Linear relationships between data. Variables, and Basic Solutions Use linear programming to solve optimization Programming Problems, entering variable, problems. 10-2 Tableaus and Pirot Operation feasible vector, initial tableau, linear function, Interpret the meaning of the maximum or Essential Question(s): 10-3 Optimal Vectors via the Simplex Method optimal vector, pivot element, pivot operation, minimum value in terms of the objective (OPTIONAL) What are some real-world situations that can simplex method, slack variables, standard function. be solved using linear programming? 10-4 Dual Programming Problems and maximum problem (SMP), tableau, vector Minimum Problems (OPTIONAL) inequalities, vector transpose Objectives: Additional Resources Students will learn: Writing in Math Simplex Method Video Research the simplex algorithm, which was Solve linear programming problems using invented by George Dantzig in the late 1940s. the simplex method. RESOURCE TOOLBOX The Resource Toolbox provides additional support for comprehension and mastery of subject-level skills and concepts. While some of these resources are embedded in the map, the use of these categorized materials can assist educators with maximizing their instructional practices to meet the needs of all students.
(CCSS) Conceptual Category: Reasoning with Equations and Inequalities Domain: Represent and solve equations and inequalities graphically. Graph the solutions to a linear inequality in two variables Objectives: Students will: Solve linear programming problems in two variables Tennessee Finite Math Textbook 7-3 Graphical Solution of Linear Programming Additional Resources Task(s) Writing in Math Determine whether the following is sometimes, always, or never true. Explain your reasoning. An unbounded region will not have both a maximum and a minimum value. Chapter 10 Linear Programming: The Simplex Method (Allow approximately 2 weeks for instruction, review, and assessment) Conceptual Category: Algebra Domain: Linear programming Use linear programming to solve optimization problems. Interpret the meaning of the maximum or minimum value in terms of the objective function. Enduring Understanding(s): A linear model can be used to represent relationships between data. Essential Question(s): What are some real-world situations that can be solved using linear programming? Objectives: Students will learn: Solve linear programming problems using the simplex method. Tennessee Finite Math Textbook 10-1 Standard Maximum Problems, Slack Variables, and Basic Solutions 10-2 Tableaus and Pirot Operation 10-3 Optimal Vectors via the Simplex Method (OPTIONAL) 10-4 Dual Programming Problems and Minimum Problems (OPTIONAL) Additional Resources Simplex Method Video Important Terms & Concepts (Chapter 10) Basic solution, decision variables, departing variable, dual of an SMP, Dual Linear Programming Problems, entering variable, feasible vector, initial tableau, linear function, optimal vector, pivot element, pivot operation, simplex method, slack variables, standard maximum problem (SMP), tableau, vector inequalities, vector transpose Writing in Math Research the simplex algorithm, which was invented by George Dantzig in the late 1940s. RESOURCE TOOLBOX The Resource Toolbox provides additional support for comprehension and mastery of subject-level skills and concepts. While some of these resources are embedded in the map, the use of these categorized materials can assist educators with maximizing their instructional practices to meet the needs of all students.
Finite%20Math%20Q3%2016-17%20Revised%2011-28-16.docx