Vitutor: Problemas resueltos de Programación Lineal
MEC : Problema de la dieta y del transporte
videos de programación lineal
unidad didáctica con problemas solucionados
Leonid Kantoróvich
solución examen 1ª evaluación 12-13
solución examen 1ª evaluación 13-14
solución recuperación 1ª evaluación 13-14
solución examen 1ª evaluación 14-15
solución examen 1ª evaluación 15-16
solución examen 1ª evaluación 16-17
Linear programming (wikipedia):
Linear programming (LP; also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (mathematical optimization).
More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equalityand linear inequality constraints. Its feasible region is a convex polytope, which is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear inequality. Its objective function is a real-valued affine function defined on this polyhedron. A linear programming algorithm finds a point in the polyhedron where this function has the smallest (or largest) value if such a point exists.
Linear programming can be applied to various fields of study. It is used in business and economics, but can also be utilized for some engineering problems. Industries that use linear programming models include transportation, energy, telecommunications, and manufacturing. It has proved useful in modeling diverse types of problems in planning, routing,scheduling, assignment, and design.
