Robust reduction of a class of large-scale linear programs
From MaRDI portal
Recommendations
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation
- scientific article; zbMATH DE number 769132
- Balance constraints reduction of large-scale linear programming problems
- scientific article; zbMATH DE number 724217
- A potential reduction algorithm for linearly constrained convex programming
- Robustness and nondegenerateness for linear complementarity problems
- Robust Solutions in Stochastic Linear Programming
- A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems
- Extensions of the potential reduction algorithm for linear programming
Cited in
(17)- On the reduction method for integer linear programs. II
- Weakly redundant constraints and their impact on postoptimal analyses in LP
- Balance constraints reduction of large-scale linear programming problems
- Reducing the number of variables in integer and linear programming problems
- Robust preliminary analysis of large-scale linear model for optimal industrial investments
- Robust avaluations for duals of non-negative linear programs with box-constrained uncertainties
- Robust reduction of dimension of a linear programming problem with uncertainties: Implication for robust production and Technology planning
- scientific article; zbMATH DE number 3858841 (Why is no real title available?)
- A heuristic approach for identification of redundant constraints in linear programming models
- scientific article; zbMATH DE number 3912109 (Why is no real title available?)
- A heuristic algorithm for resource allocation/reallocation problem
- scientific article; zbMATH DE number 1131726 (Why is no real title available?)
- scientific article; zbMATH DE number 1163814 (Why is no real title available?)
- scientific article; zbMATH DE number 769132 (Why is no real title available?)
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- Detecting constraint redundancy in 0-1 linear programming problems
- On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints
This page was built for publication: Robust reduction of a class of large-scale linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784411)