Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
From MaRDI portal
Publication:2147012
Recommendations
- Technical Note—Waterfall and Agile Product Development Approaches: Disjunctive Stochastic Programming Formulations
- Contingent Portfolio Programming for the Management of Risky Projects
- Optimization of R\&D project portfolios under endogenous uncertainty
- Balancing and optimizing a portfolio of R&D projects
- Decision programming for mixed-integer multi-stage optimization under uncertainty
Cites work
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3888886 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- A class of stochastic programs with decision dependent random elements
- A class of stochastic programs with decision dependent uncertainty
- A model for dynamic chance constraints in hydro power reservoir management
- A note on scenario reduction for two-stage stochastic programs
- Ambiguous joint chance constraints under mean and dispersion information
- An Introduction to Random Sets
- An algorithm for binary linear chance-constrained problems using IIS
- Decision-dependent probabilities in stochastic programs with recourse
- Disjunctive Programming
- Disjunctive programming
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Introduction to stochastic programming.
- Managing underperformance risk in project portfolio selection
- Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming
- On Projection Algorithms for Solving Convex Feasibility Problems
- Optimal project selection: Stochastic knapsack with finite time horizon
- Pattern-based modeling and solution of probabilistically constrained optimization problems
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Random Set Theory and Problems of Modeling
- Reducing risk and improving incentives in funding entrepreneurs
- Relaxations and approximations of chance constraints under finite distributions
- Robust optimization for interactive multiobjective programming with imprecise information applied to R\&D project portfolio selection
- Scenario reduction in stochastic programming
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Technical Note—Waterfall and Agile Product Development Approaches: Disjunctive Stochastic Programming Formulations
- The dynamic and stochastic knapsack problem
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
This page was built for publication: Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147012)
