Section 2.1 – Solving Linear Programming Problems

← Back to document page

Math 1313 Page 1 of 19 Section Section Solving Linear Programming Problems There are times when we want to know the maximum or minimum value of a function, subject to certain conditions. An objective function is a Linear function in two or more variables that is to be optimized (maximized or minimized). Linear Programming Problems are applications of Linear inequalities, which were covered in Section A Linear Programming problem consists of an objective function to be optimized subject to a system of constraints.

Section 1.4. A linear programming problem consists of an objective function to be optimized subject to a system of constraints. The constraints are a system of linear inequalities that ... Recall that the solution set to a system of inequalities is the region that satisfies all inequalities in the system. In linear programming problems, this

  Solutions, Optimized