Linear programming is a method used to achieve the best solution possible. It uses methods like the simplex method to find the maximum / minimum values of a problem.
Feasible region is the area on a graph that satisfices all constraints
Constraints are limits on the variables
Feasible solutions all possible solutions to a linear programming problem
In a standard maximization problem the main goal is to find the maximum amount of x value that is within the feasible region
Corner points
Corner points are the backbone of the simplex method. You will use the corner points found in the feasible region to find the maximum or minimum when needed
Simplex method
The simplex method is used for solving an optimization problem that usually involves a function and constraints that are inequalities
An Optimization problem is trying to foind a feasible solution within a region
Constraints may be written so that the expression involving the variable is less than or equal to a negative value.
