방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

결정론적 선형 계획법×다목적 선형 계획법 (MOLP)×
분야시뮬레이션시뮬레이션
계열Process / pipelineProcess / pipeline
기원 연도19471955–1986
창시자George B. DantzigSteuer, R. E.; Charnes, A.; Cooper, W. W.
유형Deterministic mathematical optimizationMathematical optimization / vector optimization
원전Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136Steuer, R. E. (1986). Multiple Criteria Optimization: Theory, Computation, and Application. John Wiley & Sons, New York. ISBN: 9780471888468
별칭Classical LP, Deterministic LP, DLP, Linear OptimizationMOLP, Vector Linear Programming, Multi-criteria LP, Linear Vector Optimization
관련53
요약Deterministic Linear Programming (DLP) is the classical form of linear programming in which all objective function coefficients, constraint coefficients, and right-hand-side values are known with certainty. It finds the optimal allocation of resources to maximize or minimize a linear objective subject to linear constraints, providing an exact, reproducible solution under fixed, certain data.Multi-Objective Linear Programming (MOLP) extends classical linear programming to handle several conflicting linear objective functions simultaneously over a feasible region defined by linear constraints. Instead of a single optimal solution, MOLP produces a Pareto-efficient frontier from which a decision-maker selects a preferred trade-off. It is foundational to operations research and management science for resource allocation, planning, and design problems with competing goals.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 Download slides

ScholarGate방법 비교: Deterministic Linear Programming · Multi-objective linear programming. 2026-06-15에 다음에서 검색함: https://scholargate.app/ko/compare