Sensitivity method for basis inverse representation in multistage stochastic linear programming problems

Related Items

Scenario-based stochastic programs: Resistance with respect to sample, On augmented Lagrangian decomposition methods for multistage stochastic programs

Uses Software

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Computational experience with a primal-dual interior point method for linear programming
On error growth in the Bartels-Golub and Fletcher-Matthews algorithms for updating matrix factorizations
Maintaining LU factors of a general sparse matrix
Manifestations of the Schur complement
Scenarios and Policy Aggregation in Optimization Under Uncertainty
Stable modification of explicitLU factors for simplex updates
Dual nested decomposition of staircase linear programs
Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
A regularized decomposition method for minimizing a sum of polyhedral functions
Evaluation of Orderings for Unsymmetric Sparse Matrices
A Comparative Study of Two Methods for Staircase Linear Programs
Matrix augmentation and structure preservation in linearly constrained control problems
Solving staircase linear programs by the simplex method, 1: Inversion
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
Formulating Two-Stage Stochastic Programs for Interior Point Methods
Nested decomposition for dynamic models
Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
Matrix augmentation and partitioning in the updating of the basis inverse
Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion
Solving staircase linear programs by the simplex method, 2: Pricing
Updated triangular factors of the basis to maintain sparsity in the product form simplex method
The simplex method of linear programming using LU decomposition
Reinversion with the preassigned pivot procedure