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

前往搜索 下载幻灯片

ScholarGate方法对比: GOAL-PROGRAMMING · Mixed-Integer Programming. 于 2026-06-15 检索自 https://scholargate.app/zh/compare