ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

مدل‌های مکان‌یابی-تخصیص×برنامه‌ریزی خطی×
حوزهتحلیل فضاییبهینه‌سازی
خانوادهProcess / pipelineProcess / pipeline
سال پیدایش19631947
پدیدآورLeon Cooper; S. L. HakimiGeorge B. Dantzig
نوعSpatial facility-location optimizationMathematical programming / continuous optimization
منبع بنیادین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
نام‌های دیگرfacility location, p-median problem, maximal covering location problem, yer-tahsis modelleriLP, linear optimization, Doğrusal Programlama (LP)
مرتبط44
خلاصه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.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو Download slides

ScholarGateمقایسهٔ روش‌ها: Location-Allocation · Linear Programming. بازیابی‌شده در 2026-06-15 از https://scholargate.app/fa/compare