"dynamic programming" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Richard Bellman",
        "in": "the 1940s",
        "occ": "applied mathematician",
        "w": "Richard E. Bellman"
      },
      "expansion": "Coined by applied mathematician Richard Bellman in the 1940s",
      "name": "coinage"
    }
  ],
  "etymology_text": "Coined by applied mathematician Richard Bellman in the 1940s.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "dynamic programming (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1975, Sven Danø, Nonlinear and Dynamic Programming: An Introduction, Springer Science & Business Media, page 73",
          "text": "The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.",
          "type": "quotation"
        },
        {
          "ref": "2000, Rein Luus, “Preface”, in Iterative Dynamic Programming, CRC Press",
          "text": "Dynamic programming, developed by Richard Bellmann, is a powerful method for solving optimization problems. It has the attractive feature of breaking up a complex optimization problem into a number of simpler problems.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution."
      ],
      "id": "en-dynamic_programming-en-noun-L7eK9oXM",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computer science",
          "computer science"
        ],
        [
          "optimization",
          "optimization"
        ],
        [
          "method",
          "method"
        ],
        [
          "problem",
          "problem"
        ],
        [
          "optimal substructure",
          "optimal substructure"
        ],
        [
          "recursively",
          "recursion"
        ],
        [
          "subproblem",
          "subproblem"
        ],
        [
          "global",
          "global"
        ],
        [
          "optimal",
          "optimal"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "translations": [
        {
          "code": "hy",
          "lang": "Armenian",
          "roman": "dinamik cragravorum",
          "sense": "dynamic programming",
          "word": "դինամիկ ծրագրավորում"
        },
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "dynamic programming",
          "word": "dynaaminen ohjelmointi"
        },
        {
          "code": "ru",
          "lang": "Russian",
          "roman": "dinamíčeskoje programmírovanije",
          "sense": "dynamic programming",
          "tags": [
            "neuter"
          ],
          "word": "динами́ческое программи́рование"
        }
      ]
    }
  ],
  "word": "dynamic programming"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Richard Bellman",
        "in": "the 1940s",
        "occ": "applied mathematician",
        "w": "Richard E. Bellman"
      },
      "expansion": "Coined by applied mathematician Richard Bellman in the 1940s",
      "name": "coinage"
    }
  ],
  "etymology_text": "Coined by applied mathematician Richard Bellman in the 1940s.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "dynamic programming (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English coinages",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms coined by Richard Bellman",
        "English terms with quotations",
        "English uncountable nouns",
        "en:Computer science",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "1975, Sven Danø, Nonlinear and Dynamic Programming: An Introduction, Springer Science & Business Media, page 73",
          "text": "The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.",
          "type": "quotation"
        },
        {
          "ref": "2000, Rein Luus, “Preface”, in Iterative Dynamic Programming, CRC Press",
          "text": "Dynamic programming, developed by Richard Bellmann, is a powerful method for solving optimization problems. It has the attractive feature of breaking up a complex optimization problem into a number of simpler problems.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computer science",
          "computer science"
        ],
        [
          "optimization",
          "optimization"
        ],
        [
          "method",
          "method"
        ],
        [
          "problem",
          "problem"
        ],
        [
          "optimal substructure",
          "optimal substructure"
        ],
        [
          "recursively",
          "recursion"
        ],
        [
          "subproblem",
          "subproblem"
        ],
        [
          "global",
          "global"
        ],
        [
          "optimal",
          "optimal"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "translations": [
    {
      "code": "hy",
      "lang": "Armenian",
      "roman": "dinamik cragravorum",
      "sense": "dynamic programming",
      "word": "դինամիկ ծրագրավորում"
    },
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "dynamic programming",
      "word": "dynaaminen ohjelmointi"
    },
    {
      "code": "ru",
      "lang": "Russian",
      "roman": "dinamíčeskoje programmírovanije",
      "sense": "dynamic programming",
      "tags": [
        "neuter"
      ],
      "word": "динами́ческое программи́рование"
    }
  ],
  "word": "dynamic programming"
}