Pages that link to "Item:Q5202511"

The following pages link to Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution (Q5202511):

Displaying 50 items.

• Decomposition algorithms for two-stage chance-constrained programs (Q291060) (← links)
• Nonlinear chance constrained problems: optimality conditions, regularization and solvers (Q306384) (← links)
• Using integer programming for balancing return and risk in problems with individual chance constraints (Q342012) (← links)
• Capital rationing problems under uncertainty and risk (Q429488) (← links)
• Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints (Q439920) (← links)
• A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality (Q535064) (← links)
• Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
• Belief linear programming (Q622260) (← links)
• Uniform quasi-concavity in probabilistic constrained stochastic programming (Q635508) (← links)
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
• Solving joint chance constrained problems using regularization and Benders' decomposition (Q827143) (← links)
• Construction of confidence absorbing set for analysis of static stochastic systems (Q827962) (← links)
• MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
• Mathematical programming approaches for generating \(p\)-efficient points (Q992653) (← links)
• A compromise solution for the multiobjective stochastic linear programming under partial uncertainty (Q1038376) (← links)
• Perturbation analysis of linear programming problems with random parameters (Q1318521) (← links)
• SLP-IOR: An interactive model management system for stochastic linear programs (Q1363427) (← links)
• Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
• Risk tomography (Q1681334) (← links)
• A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• On the probability of union in the $n$-space (Q1727940) (← links)
• Computing the probability of union in the $n$-dimensional Euclidean space for application of the multivariate quantile: $p$-level efficient points (Q1728220) (← links)
• Shared mobility systems: an updated survey (Q1730532) (← links)
• Bounds for probabilistic integer programming problems (Q1850114) (← links)
• Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function (Q1904656) (← links)
• A simple recourse model for power dispatch under uncertain demand (Q1904676) (← links)
• Multivariate value at risk and related topics (Q1931628) (← links)
• Pattern definition of the \(p\)-efficiency concept (Q1931642) (← links)
• Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection (Q1935293) (← links)
• An exact approach for solving integer problems under probabilistic constraints with random technology matrix (Q1958623) (← links)
• Gaining traction: on the convergence of an inner approximation scheme for probability maximization (Q2045616) (← links)
• Bounds for probabilistic programming with application to a blend planning problem (Q2060407) (← links)
• Chance-constrained sets approximation: a probabilistic scaling approach (Q2071956) (← links)
• Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements (Q2147012) (← links)
• Exact penalization in stochastic programming -- calmness and constraint qualification (Q2260525) (← links)
• Decision-making from a risk assessment perspective for corporate mergers and acquisitions (Q2355199) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
• Probabilistic programming models for traffic incident management operations planning (Q2393494) (← links)
• Proportional and maxmin fairness for the sensor location problem with chance constraints (Q2414477) (← links)
• Vector-valued multivariate conditional value-at-risk (Q2417154) (← links)
• An algorithm for binary linear chance-constrained problems using IIS (Q2419523) (← links)
• On mixing sets arising in chance-constrained programming (Q2429465) (← links)
• Properties and calculation of multivariate risk measures: MVaR and MCVaR (Q2449353) (← links)
• Genetic algorithm based technique for solving chance constrained problems (Q2464197) (← links)
• Beam search heuristic to solve stochastic integer problems under probabilistic constraints (Q2484339) (← links)
• Chance constrained unit commitment approximation under stochastic wind energy (Q2669502) (← links)
• Robust market equilibria under uncertain cost (Q2672150) (← links)
• Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
• Single commodity stochastic network design under probabilistic constraint with discrete random variables (Q2797468) (← links)