The principle states that an optimal policy contains an optimal continuation from every reached state. This recursive subproblem structure underlies dynamic programming, C. It permits a multistage decision problem to be solved through value-function recursions.
More Operations Research questions
GATE 2020 PI Q43– Maximize Z=3x₁+2x₂ subject to x₁+2x₂≤2,2x₁+x₂≤2 and x₁,x₂≥0. Find the shadow price of…
GATE 2026 PI Q14– Which option gives ALL constraints defining the feasible region shown? The figure is not…
GATE 2026 PI Q22– In the weighted graph, edge weights are distances. Let d be the shortest distance from A…
GATE 2026 PI Q44– An M/M/1 queue has arrival rate three customers per minute and steady-state mean number n…
GATE 2026 PI Q58– Two oil plants must meet demands of two markets. Costs per litre are C₁₁ = 250, C₁₂ = 280,…
GATE 2025 PI Q27– A starting simplex tableau maximizes z=6x 1+4x 2. Rows list [x₁,x₂,S₁,S₂,S₃,S₄ RHS]: S₁:…