পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| বহু-উদ্দেশ্য মিশ্র-পূর্ণসাংখ্যিক প্রোগ্রামিং× | বহু-উদ্দেশ্যমূলক ডাইনামিক প্রোগ্রামিং× | |
|---|---|---|
| ক্ষেত্র | অনুকরণ | অনুকরণ |
| পরিবার | Process / pipeline | Process / pipeline |
| উদ্ভবের বছর≠ | 1980s–2000s | 1957-1975 |
| প্রবর্তক≠ | Ehrgott, M.; Mavrotas, G. and others in multi-criteria optimization | Extension of Bellman (1957); formalized by multiple authors from 1970s onward |
| ধরন≠ | Mathematical optimization | Exact optimization — recursive multi-objective decomposition |
| মৌলিক উৎস≠ | Ehrgott, M. (2005). Multicriteria Optimization (2nd ed.). Springer, Berlin. ISBN: 9783540213987 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 |
| অপর নাম | MO-MIP, Multi-criteria MIP, MOMIP, Multi-objective MILP | MODP, Multi-criteria dynamic programming, Vector dynamic programming, Pareto dynamic programming |
| সম্পর্কিত | 5 | 5 |
| সারসংক্ষেপ≠ | Multi-Objective Mixed-Integer Programming (MO-MIP) is an optimization framework that simultaneously optimizes two or more conflicting objective functions subject to linear or nonlinear constraints, where some decision variables are restricted to integer values and others are continuous. It is widely applied in engineering design, supply chain planning, resource allocation, and scheduling problems that require discrete choices alongside continuous quantities. | Multi-Objective Dynamic Programming (MODP) extends Bellman's classical dynamic programming to settings where a decision-maker must optimize several competing objectives simultaneously across a sequence of stages. Rather than a single optimal policy, it produces a Pareto-optimal set of policies — each representing a distinct trade-off profile — by propagating vector-valued value functions backward through the state space. |
| ScholarGateডেটাসেট ↗ |
|
|