An external reconstruction approach (ERA) to linear programming
From MaRDI portal
Recommendations
- An exterior-point method for linear programming problems
- scientific article; zbMATH DE number 1513156
- On using exterior penalty approaches for solving linear programming problems
- Extragradient method for correction of inconsistent linear programming problems
- Extensions of the potential reduction algorithm for linear programming
- scientific article; zbMATH DE number 710572
- An extension of the entropic perturbation method of linear programming
- An experimental approach to karmarkar’s projective method for linear programming
- The Use of Linear Programming in the Construction of Extremal Solutions to Linear Inverse Problems
- An exterior point simplex algorithm for (general) linear programming problems
Cites work
- scientific article; zbMATH DE number 3891117 (Why is no real title available?)
- scientific article; zbMATH DE number 3945836 (Why is no real title available?)
- Nonadjacent extreme point methods for solving linear programs
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
Cited in
(6)- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
- Interactive fuzzy linear programming
- A multiprocessor interior point algorithm
- OPTIMIZING GIVEN SYSTEMS vs. DESIGNING OPTIMAL SYSTEMS: THE DE NOVO PROGRAMMING APPROACH
- Optimal system design: Towards new interpretation of shadow prices in linear programming
- An interior feasible direction method with constraint projections for linear programming
This page was built for publication: An external reconstruction approach (ERA) to linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099782)
