Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Lokalisering-allokeringsmodeller× | Linjärprogrammering× | |
|---|---|---|
| Ämnesområde≠ | Rumslig analys | Optimering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1963 | 1947 |
| Upphovsperson≠ | Leon Cooper; S. L. Hakimi | George B. Dantzig |
| Typ≠ | Spatial facility-location optimization | Mathematical programming / continuous optimization |
| Ursprungskälla≠ | Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗ | Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136 |
| Alias≠ | facility location, p-median problem, maximal covering location problem, yer-tahsis modelleri | LP, linear optimization, Doğrusal Programlama (LP) |
| Närliggande | 4 | 4 |
| Sammanfattning≠ | Location-allocation models decide where to place a set of facilities and simultaneously assign demand points to them so as to optimize an objective such as total travel cost, worst-case distance, or population covered. Rooted in the operations-research work of Cooper (1963) and Hakimi (1964) and central to network GIS, they answer questions like where to site warehouses, hospitals, fire stations, or schools to best serve a spatially distributed population. | 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. |
| ScholarGateDatamängd ↗ |
|
|