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

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

برنامه‌ریزی عدد صحیح (IP) و برنامه‌ریزی عدد صحیح مختلط (MIP)×برنامه‌ریزی هدف×
حوزهبهینه‌سازیتصمیم‌گیری
خانوادهProcess / pipelineMCDM
سال پیدایش19581955
پدیدآورRalph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960)Charnes, A., Cooper, W. W.
نوعMathematical optimisation — exact combinatorial methodMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
منبع بنیادینWolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗
نام‌های دیگرIP, MIP, mixed-integer programming, mixed-integer linear programming
مرتبط48
خلاصه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.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 1 منابع
  3. PUBLISHED

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

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