Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Heltalsprogrammering× | Målprogrammering× | |
|---|---|---|
| Ämnesområde≠ | Optimering | Beslutsfattande |
| Familj≠ | Process / pipeline | MCDM |
| Ursprungsår≠ | 1958 | 1955 |
| Upphovsperson≠ | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) | Charnes, A., Cooper, W. W. |
| Typ≠ | Mathematical optimisation — exact combinatorial method | Multi-objective optimisation — weighted/lexicographic goal deviation minimisation |
| Ursprungskälla≠ | Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669 | Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗ |
| Alias≠ | IP, MIP, mixed-integer programming, mixed-integer linear programming | — |
| Närliggande≠ | 4 | 8 |
| Sammanfattning≠ | Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems. | 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. |
| ScholarGateDatamängd ↗ |
|
|