ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Målprogrammering×Blandet-heltallig programmering×
FagområdeBeslutningstagningSimulering
FamilieMCDMProcess / pipeline
Oprindelsesår19551958–1960
OphavspersonCharnes, A., Cooper, W. W.Ralph Gomory (branch-and-bound cuts, 1958); Land & Doig (branch-and-bound, 1960)
TypeMulti-objective optimisation — weighted/lexicographic goal deviation minimisationMathematical optimization
Oprindelig kildeCharnes, 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
AliasserMIP, Mixed-Integer Linear Programming, MILP, Integer Programming
Relaterede86
Resumé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.
ScholarGateDatasæt
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søgning Download slides

ScholarGateSammenlign metoder: GOAL-PROGRAMMING · Mixed-Integer Programming. Hentet 2026-06-15 fra https://scholargate.app/da/compare