Mindmap
Linear Programming
Inhalt der Mindmap
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
Informationen
- Beschreibung
- Mindmap am Linear Programming, erstellt von Santiago MORENO ACOSTA am 25/08/2021.
- Erstellt von
- Santiago MORENO ACOSTA
- Aufrufe
- 4
- Bewertung