Computational behavior of a feasible direction method for linear programming
From MaRDI portal
Recommendations
Cites work
- A feasible direction method for linear programming
- scientific article; zbMATH DE number 3904322 (Why is no real title available?)
- scientific article; zbMATH DE number 3961338 (Why is no real title available?)
- scientific article; zbMATH DE number 3626518 (Why is no real title available?)
- scientific article; zbMATH DE number 3206575 (Why is no real title available?)
- scientific article; zbMATH DE number 3284927 (Why is no real title available?)
Cited in
(8)- Pure adaptive search in Monte Carlo optimization
- A computational study of redundancy in randomly generated polytopes
- Computer Codes for the Analysis of Infeasible Linear Programs
- A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method
- A global pricing extension of the simplex method
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
- Experiments with external pivoting
- The complex interior-boundary method for linear and nonlinear programming with linear constraints
This page was built for publication: Computational behavior of a feasible direction method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119474)