Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Programowanie celowe× | Programowanie liniowe× | |
|---|---|---|
| Dziedzina≠ | Podejmowanie decyzji | Optymalizacja |
| Rodzina≠ | MCDM | Process / pipeline |
| Rok powstania≠ | 1955 | 1947 |
| Twórca≠ | Charnes, A., Cooper, W. W. | George B. Dantzig |
| Typ≠ | Multi-objective optimisation — weighted/lexicographic goal deviation minimisation | Mathematical programming / continuous optimization |
| Źródło pierwotne≠ | Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗ | Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136 |
| Inne nazwy≠ | — | LP, linear optimization, Doğrusal Programlama (LP) |
| Pokrewne≠ | 8 | 4 |
| Podsumowanie≠ | GOAL-PROGRAMMING (Goal Programming — Minimise deviations from multiple aspiration levels) is a ranking multi-criteria decision-making (MCDM) method introduced by Charnes, A., Cooper, W. W. in 1955. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result. | 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. |
| ScholarGateZbiór danych ↗ |
|
|