Linear programming is a mathematical method (such as maximum profit or lowest cost) to achieve the best outcome in which the requirements are represented by linear relationships.
The main goal for a standard maximization problem is to find the maximum amount of the x value that is within the feasible region
A feasible region is a space where all candidate solutions that are before any feasible points have been excluded.
Feasible solutions are all possible solutions to a liner programing question.
Constraints are restrictions on variables
Simplex Method
A simplex method is a different method to solving linear programming models by solving an optimization problem that usually involves by hand using slack variables, tableaus, and pivot variables
Optimization problem is trying to find a feasible solution
Constraints can be written as an expression involving the variable
