পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| ডায়নামিক প্রোগ্রামিং× | গোল প্রোগ্রামিং× | রৈখিক প্রোগ্রামিং× | |
|---|---|---|---|
| ক্ষেত্র≠ | অনুকূলকরণ | সিদ্ধান্ত গ্রহণ | অনুকূলকরণ |
| পরিবার≠ | Process / pipeline | MCDM | Process / pipeline |
| উদ্ভবের বছর≠ | 1957 | 1955 | 1947 |
| প্রবর্তক≠ | Richard Bellman | Charnes, A., Cooper, W. W. | George B. Dantzig |
| ধরন≠ | Exact combinatorial optimization via recursive decomposition | Multi-objective optimisation — weighted/lexicographic goal deviation minimisation | Mathematical programming / continuous optimization |
| মৌলিক উৎস≠ | Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6 | Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗ | Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136 |
| অপর নাম≠ | DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama | — | LP, linear optimization, Doğrusal Programlama (LP) |
| সম্পর্কিত≠ | 3 | 8 | 4 |
| সারসংক্ষেপ≠ | Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure. | 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. | Linear programming (LP), pioneered by George B. Dantzig in 1947, is a mathematical method for finding the best value of a linear objective function — such as minimum cost or maximum profit — subject to a set of linear inequality and equality constraints. It is the foundational technique in operations research and underlies production planning, resource allocation, logistics, diet problems, and countless other decision-making scenarios across engineering, economics, and the natural sciences. |
| ScholarGateডেটাসেট ↗ |
|
|
|