Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Programowanie celowe× | Programowanie całkowitoliczbowe× | |
|---|---|---|
| Dziedzina≠ | Podejmowanie decyzji | Symulacja |
| Rodzina≠ | MCDM | Process / pipeline |
| Rok powstania≠ | 1955 | 1958–1960 |
| Twórca≠ | Charnes, A., Cooper, W. W. | Ralph Gomory (branch-and-bound cuts, 1958); Land & Doig (branch-and-bound, 1960) |
| Typ≠ | Multi-objective optimisation — weighted/lexicographic goal deviation minimisation | Mathematical optimization |
| Źródło pierwotne≠ | Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗ | Nemhauser, G. L., Wolsey, L. A. (1988). Integer and Combinatorial Optimization. Wiley-Interscience, New York. ISBN: 9780471359432 |
| Inne nazwy≠ | — | MIP, Mixed-Integer Linear Programming, MILP, Integer Programming |
| Pokrewne≠ | 8 | 6 |
| 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. | Mixed-Integer Programming (MIP) is a mathematical optimization framework in which some decision variables must take integer values while others may be continuous. It generalizes linear programming and is widely used in operations research, logistics, scheduling, resource allocation, and engineering design, where indivisibility constraints — such as yes/no decisions or whole-unit quantities — arise naturally. |
| ScholarGateZbiór danych ↗ |
|
|