A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
From MaRDI portal
Cited in
(31)- Criteria for copositive matrices
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- Testing the definiteness of matrices on polyhedral cones
- Almost copositive matrices
- Complete solutions for a class of elastic-plastic structures
- On the resolution of some unilaterally constrained problems in structural engineering
- Some n by dn linear complementarity problems
- On the parametric linear complementarity problem: A generalized solution procedure
- Minimum theorems for displacement and plastic strain rate histories in structural elastoplasticity
- Linear complementarity problems and characterizations of Minkowski matrices
- A reduction theorem for the linear complementarity problem with a certain patterned matrix
- Fully copositive matrices
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- Quadratic-programming criteria for copositive matrices
- A hybrid algorithm for the solution of a single commodity spatial equilibrium model
- The reduced order method for solving the linear complementarity problem with an \(M\)-matrix
- Quasidefinite Matrizen
- An application of homotopy to solving linear programs
- A unified approach to one-parametric general quadratic programming
- A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
- A complementary variant of Lemke's method for the linear complementary problem
- Isotone solutions of parametric linear complementarity problems
- A parametric linear complementarity problem involving derivatives
- On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
- A procedure for the one-parametric linear complementarity problem
- Monotone solutions of the parametric linear complementarity problem
- Direct algorithms in quadratic programming
- On the classes of fully copositive and fully semimonotone matrices
- The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix
- Large scale nonholonomic elastoplastic analysis using a linear complementarity formulation
- A comparison of solvers for linear complementarity problems arising from large-scale masonry structures.
This page was built for publication: A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5534687)