Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs
From MaRDI portal
Recommendations
- Non-parametric approach to stochastic linear programming
- Random linear programs with many variables and few constraints
- Approximate Lagrange multiplier algorithm for stochastic programs with complete recourse: Nonlinear deterministic constraints
- A Linearization Method for Nonsmooth Stochastic Programming Problems
- A stochastic approach to general nonlinear programming problems
- A linear programming approach for linear programs with probabilistic constraints
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
- scientific article; zbMATH DE number 1187214
- Publication:3491315
Cites work
- A set of staircase linear programming test problems
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
- Redundancy in mathematical programming. A state-of-the-art survey
- Stochastic Programs with Recourse
- The Value of Information and Stochastic Programming
Cited in
(6)- An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems
- A new approach to the analysis of random methods for detecting necessary linear inequality constraints
- Heuristic methods and applications: A categorized survey
- scientific article; zbMATH DE number 4031403 (Why is no real title available?)
- A comparative study of redundant constraints identification methods in linear programming problems
- Reduction of nonanticipativity constraints in multistage stochastic programming problems with endogenous and exogenous uncertainty
This page was built for publication: Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217951)