Surface movement method for linear programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3700567 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 1240224 (Why is no real title available?)
- scientific article; zbMATH DE number 2046112 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints
- A survey of some linear programming methods
- Advances in the parallelization of the simplex method
- An exponential lower bound for Zadeh's pivot rule
- Anticipatory optimization for dynamic decision making
- Hyper-sparsity in the revised simplex method and how to exploit it
- Interior Point Methods for Linear Optimization
- Interior point algorithms in linear optimization
- Interior point methods 25 years later
- Linear Programming
- Linear and convex optimization. A mathematical approach
- Parallel Processing and Applied Mathematics
- Primal-dual solution for the linear programming problems using neural networks
- The Complexity of Zadeh's Pivot Rule
- Towards a practical parallelisation of the simplex method
- Unifying the Tank and Hopfield linear programming circuit and the canonical nonlinear programming circuit of Chua and Lin
This page was built for publication: Surface movement method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986069)
