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

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

برنامه‌ریزی خطی×برنامه‌ریزی هدف×
حوزهبهینه‌سازیتصمیم‌گیری
خانوادهProcess / pipelineMCDM
سال پیدایش19471955
پدیدآورGeorge B. DantzigCharnes, A., Cooper, W. W.
نوعMathematical programming / continuous optimizationMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
منبع بنیادینDantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗
نام‌های دیگرLP, linear optimization, Doğrusal Programlama (LP)
مرتبط48
خلاصه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.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.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED

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

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