পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| বহু-উদ্দেশ্য মিশ্র-পূর্ণসাংখ্যিক প্রোগ্রামিং× | মিশ্র-পূর্ণসংখ্যা প্রোগ্রামিং× | |
|---|---|---|
| ক্ষেত্র | অনুকরণ | অনুকরণ |
| পরিবার | Process / pipeline | Process / pipeline |
| উদ্ভবের বছর≠ | 1980s–2000s | 1958–1960 |
| প্রবর্তক≠ | Ehrgott, M.; Mavrotas, G. and others in multi-criteria optimization | Ralph Gomory (branch-and-bound cuts, 1958); Land & Doig (branch-and-bound, 1960) |
| ধরন | Mathematical optimization | Mathematical optimization |
| মৌলিক উৎস≠ | Ehrgott, M. (2005). Multicriteria Optimization (2nd ed.). Springer, Berlin. ISBN: 9783540213987 | Nemhauser, G. L., Wolsey, L. A. (1988). Integer and Combinatorial Optimization. Wiley-Interscience, New York. ISBN: 9780471359432 |
| অপর নাম | MO-MIP, Multi-criteria MIP, MOMIP, Multi-objective MILP | MIP, Mixed-Integer Linear Programming, MILP, Integer Programming |
| সম্পর্কিত≠ | 5 | 6 |
| সারসংক্ষেপ≠ | 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. | 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ডেটাসেট ↗ |
|
|