Σύγκριση μεθόδων

	Γραμμικός Προγραμματισμός με Ντετερμινιστικές Τιμές	Προγραμματισμός Πολλαπλών Στόχων (MOLP)
Πεδίο	Προσομοίωση	Προσομοίωση
Οικογένεια	Process / pipeline	Process / pipeline
Έτος προέλευσης	1947	1955–1986
Δημιουργός	George B. Dantzig	Steuer, R. E.; Charnes, A.; Cooper, W. W.
Τύπος	Deterministic mathematical optimization	Mathematical optimization / vector optimization
Θεμελιώδης πηγή	Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ. ISBN: 9780691059136	Steuer, R. E. (1986). Multiple Criteria Optimization: Theory, Computation, and Application. John Wiley & Sons, New York. ISBN: 9780471888468
Εναλλακτικές ονομασίες	Classical LP, Deterministic LP, DLP, Linear Optimization	MOLP, Vector Linear Programming, Multi-criteria LP, Linear Vector Optimization
Συναφείς	5	3
Σύνοψη	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.