Skip to main content

Questions tagged [dynamic-programming]

For questions about dynamic programming, a mathematical optimization technique where the optimal solution to the problem is found by breaking it down to simpler sub-problems and solved recursively.

Filter by
Sorted by
Tagged with
-1 votes
0 answers
27 views

this is rephrased version of a previous question, to be a bit more precise. This is my proposed labeling algorithm to solve the Subproblems in my Branch&Price algorithm. Labeling Algorithm For ...
mingabua's user avatar
3 votes
2 answers
201 views

I’m working on an optimization problem that I believe can be framed as a graph or flow problem, but I haven’t found a good existing formulation that scales efficiently. I’d like advice on how to model ...
Teun's user avatar
  • 133
0 votes
0 answers
34 views

We define the all-subset-sum problem as follows. Given a set $S$ of positive integers and a target $T$, the goal is to find all the maximal distinct subsets of $S$ summing to $T$. A maximal set is a ...
Samuel Bismuth's user avatar
0 votes
1 answer
127 views

More comprehensively, what is the technical term of the situation in which the SDDP (stochastic dual dynamic programming) algorithm can solve a non-recoursable problem because the feasible actions ...
Engr. Moiz Ahmad's user avatar
0 votes
0 answers
76 views

I am struggling with the following problem. A college student has 7 days remaining before final examinations begin in her four courses, and she wants to allocate this study time as effectively as ...
ryan's user avatar
  • 1
2 votes
1 answer
144 views

In the following inventory problem, there are $N$ units of inventory available at the beginning of the time horizon $T$. Each day $t\in T$, it is possible to sell one unit of the inventory at price $...
NormalFit's user avatar
  • 488
1 vote
0 answers
85 views

I have a variation of the knapsack problem where each item has a profit ($p_i$), weight ($w_i$), and penalty ($t_i$). The objective is to maximize the summation of the selected items' profits minus ...
OR Junior's user avatar
  • 613
1 vote
0 answers
34 views

Have there been any comprehensive surveys or meta-analyses examining the efficacy of various refueling algorithms(such as this or approximation algorithms etc) across varying graph distances? ...
GEP's user avatar
  • 119
1 vote
0 answers
58 views

I have a problem that I haven't encountered before and would like to know if there is any literature on the problem - or maybe you can help me simplify my problem if you think I'm doing something ...
E.S.'s user avatar
  • 11
1 vote
1 answer
117 views

I encountered this lemma in a research paper related to End-to-End inventory management model. Please note that $d_{[t_1,t_2]} = \sum_{t=t_1}^{t_2} d_i$, where $d_t$ denotes demand at time instance t. ...
Abhilash Mishra's user avatar
2 votes
2 answers
173 views

Consider the following problem \begin{equation} \begin{aligned} \min_{x,y,z} \quad & \sum_{i=0}^1 \sum_{j=0}^1 \sum_{k=0}^1 a_{ijk} \cdot f_{ijk}(x,y,z), \\ \textrm{s.t.} \quad &...
Mahmoud's user avatar
  • 639
0 votes
1 answer
89 views

I am studying Stochastic Dynamic Programming using Sheldon Ross's book, "Introduction to Stochastic Dynamic Programming." In the book, Ross defines a dynamic programming algorithm to ...
Resting Platypus's user avatar
1 vote
1 answer
218 views

I want to know if dynamic programming can generally find globaly optimal solutions for scheduling problems? I think this might be difficult as dynamic makes one at a time decisions without calculating ...
PeterBe's user avatar
  • 1,722
2 votes
1 answer
96 views

I am using SDDP.jl for my research project and want to use continuous distribution, can I do so?
Engr. Moiz Ahmad's user avatar
0 votes
1 answer
66 views

I am using SDDP.jl for my research project in which I am developing a state-of-the-art actor critic algorithm which I am going to benchmark with SDDP but for it I need to plot graphs which require ...
Engr. Moiz Ahmad's user avatar

15 30 50 per page