Mind map
Linear Programming
Map content
Linear Programming
responds to situations
- minimize functions
- maximize functions
Restrictions
- Refers to everything that limits the freedom of values
Core items
- Objective Function
- Variables
- Restrictions
Every linear programming problem is
- Concave
- Convex
Properties
- An isolated point on an edge cannot be optimal
- A linear problem cannot have optimal solutions at interior points of the domain
- The optimal solutions will be at the vertices
Feasible solution
- intersection set, of all the half-planes formed by the constraints
Optimal solution
- Set of the vertices of the enclosure is called the set of basic feasible solutions
Linear program value
- It is the value that the objective function takes at the optimal solution vertex
Methods used
- Graphic method
- it is possible if you have no more than two variables
- Simplex method
- iterative algebraic procedure that solves any problem in a finite number of steps
- Graphic method
Information
- Description
- Mind Map on Linear Programming, created by Santiago MORENO ACOSTA on 25/08/2021.
- Created by
- Santiago MORENO ACOSTA
- Views
- 4
- Rating