Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Deterministické celočíselné programování× | Lineární programování× | |
|---|---|---|
| Obor≠ | Simulace | Optimalizace |
| Rodina | Process / pipeline | Process / pipeline |
| Rok vzniku≠ | 1958 | 1947 |
| Tvůrce≠ | Ralph E. Gomory | George B. Dantzig |
| Typ≠ | Exact combinatorial optimization | Mathematical programming / continuous optimization |
| Původní zdroj≠ | Gomory, R. E. (1958). Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society, 64(5), 275-278. DOI ↗ | Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136 |
| Další názvy≠ | DIP, Integer Programming, IP, Integer Linear Programming | LP, linear optimization, Doğrusal Programlama (LP) |
| Příbuzné≠ | 5 | 4 |
| Shrnutí≠ | Deterministic Integer Programming (DIP) is a mathematical optimization approach that finds the best solution to problems where some or all decision variables must take integer values, given fully known (deterministic) objective and constraint data. It is the classical, non-stochastic form of integer programming, foundational to operations research and combinatorial optimization since the late 1950s. | Linear programming (LP), pioneered by George B. Dantzig in 1947, is a mathematical method for finding the best value of a linear objective function — such as minimum cost or maximum profit — subject to a set of linear inequality and equality constraints. It is the foundational technique in operations research and underlies production planning, resource allocation, logistics, diet problems, and countless other decision-making scenarios across engineering, economics, and the natural sciences. |
| ScholarGateDatová sada ↗ |
|
|