Linear Program Solving Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - ". ----" to ". ----")
m (Text replacement - "]] *** " to "]]. *** ")
Line 37: Line 37:
**** [[Dantzig–Wolfe decomposition]]
**** [[Dantzig–Wolfe decomposition]]
**** [[Theory of two-level planning]]
**** [[Theory of two-level planning]]
**** [[Variable splitting]]
**** [[Variable splitting]].
*** [[Basic solution (linear programming)]] — solution at vertex of feasible region
*** [[Basic solution (linear programming)]] — solution at vertex of feasible region
*** [[Fourier–Motzkin elimination]]
*** [[Fourier–Motzkin elimination]].
*** [[Hilbert basis (linear programming)]] — set of integer vectors in a convex cone which generate all integer vectors in the cone
*** [[Hilbert basis (linear programming)]] — set of integer vectors in a convex cone which generate all integer vectors in the cone
*** [[LP-type problem]]
*** [[LP-type problem]].
*** [[Linear inequality]]
*** [[Linear inequality]].
*** [[Vertex enumeration problem]] — list all vertices of the feasible set
*** [[Vertex enumeration problem]] — list all vertices of the feasible set



Revision as of 00:44, 24 July 2023

A Linear Program Solving Algorithm is a continuous optimization algorithm that can be implemented by a linear programming system (to solve a linear programming task).



References

2016