Pages that link to "Item:Q4149218"
From MaRDI portal
The following pages link to Matrix augmentation and partitioning in the updating of the basis inverse (Q4149218):
Displayed 16 items.
- Canonical bases in linear programming (Q908850) (← links)
- MSLiP: A computer code for the multistage stochastic linear programming problem (Q914552) (← links)
- On the use of expert systems in network optimization: With an application to matrix balancing (Q918444) (← links)
- Solving many linear programs that differ only in the right-hand side (Q1108193) (← links)
- On the use of dense matrix techniques within sparse simplex (Q1309853) (← links)
- Sensitivity method for basis inverse representation in multistage stochastic linear programming problems (Q1321212) (← links)
- The conical methodology and the evolution of simulation model development (Q1805478) (← links)
- An iterative working-set method for large-scale nonconvex quadratic programming (Q1862010) (← links)
- Solving linear programs with multiple right-hand sides: Pricing and ordering schemes (Q1918430) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem (Q3694975) (← links)
- A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
- A bump triangular dynamic factorization algorithm for the simplex method (Q3865837) (← links)
- Matrix augmentation and structure preservation in linearly constrained control problems (Q3875762) (← links)
- Matrix augmentation and partitioning in the updating of the basis inverse (Q4149218) (← links)
- Stable algorithm for updating dense<i>LU</i>factorization after row or column exchange and row and column addition or deletion (Q4327873) (← links)
