Lagrangian Dual Decision Rules for Multistage Stochastic Mixed-Integer Programming
Bibliographic record
Abstract
On Decision Rules for Multistage Stochastic Programs with Mixed-Integer Decisions Multistage stochastic programming is a field of stochastic optimization for addressing sequential decision-making problems defined over a stochastic process with a given probability distribution. The solution to such a problem is a decision rule (policy) that maps the history of observations to the decisions. Design of the decision rules in the presence of mixed-integer decisions is quite challenging. In “Lagrangian Dual Decision Rules for Multistage Stochastic Mixed-Integer Programming,” Daryalal, Bodur, and Luedtke introduce Lagrangian dual decision rules, where linear decision rules are applied to dual multipliers associated with Lagrangian duals of a multistage stochastic mixed-integer programming (MSMIP) model. The restricted decisions are then used in the development of new primal- and dual-bounding methods. This yields a new general-purpose approximation approach for MSMIP, free of strong assumptions made in the literature, such as stagewise independence or existence of a tractable-sized scenario-tree representation.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.007 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.005 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".