ScholarGate
دستیار

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

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

برنامه‌ریزی هدف×برنامه‌ریزی عدد صحیح مختلط×
حوزهتصمیم‌گیریشبیه‌سازی
خانوادهMCDMProcess / pipeline
سال پیدایش19551958–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 minimisationMathematical 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
مرتبط86
خلاصه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مجموعه‌داده
  1. v1
  2. 1 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

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

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