Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| Программиране с целеви стойности (Goal Programming)× | Целочислено линейно оптимиране× | |
|---|---|---|
| Област≠ | Вземане на решения | Симулационно моделиране |
| Семейство≠ | MCDM | Process / pipeline |
| Година на възникване≠ | 1955 | 1958–1960 |
| Създател≠ | Charnes, A., Cooper, W. W. | Ralph Gomory (branch-and-bound cuts, 1958); Land & Doig (branch-and-bound, 1960) |
| Тип≠ | Multi-objective optimisation — weighted/lexicographic goal deviation minimisation | Mathematical optimization |
| Основополагащ източник≠ | 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 |
| Други названия≠ | — | MIP, Mixed-Integer Linear Programming, MILP, Integer Programming |
| Свързани≠ | 8 | 6 |
| Резюме≠ | 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. |
| ScholarGateНабор от данни ↗ |
|
|