Open AccessBook
Linear complementarity, linear and nonlinear programming
About:
The article was published on 1988-01-01 and is currently open access. It has received 1012 citations till now. The article focuses on the topics: Mixed complementarity problem & Complementarity theory.read more
Citations
More filters
Journal ArticleDOI
On the preconditioned projective iterative methods for the linear complementarity problems
TL;DR: This paper presents a new strategy with a new preconditioner that ensures the solution of the same problem is correct and studies the convergence properties of the new precondoed iterative method for solving linear complementarity problem (LCP).
Gaussian pivoting method forsolving linear complementarity problem
TL;DR: In this article, a direct algorithm for solving linear complementarity problem with Z-matrix is proposed, which exhibits either a solution or its nonexistence after at most n steps (where n is the dimension of the problem).
Journal ArticleDOI
Enhanced intersection cutting-plane approach for linear complementarity problems
TL;DR: In this article, an enhanced intersection cutting-plane algorithm for solving a mixed integer 0 − 1 bilinear programming formulation of the linear complementarity problem (LCP) is presented.
Scaling Dualities and Self-Concordant Homogeneous Programming in Finite Dimensional Spaces
TL;DR: The scaling duality as mentioned in this paper has been used to characterize exact and approximate solvability of four conic problems in finite dimensional spaces, defined as: homogeneous programming (HP), scaling problem (SP), HSP, and algebraic scaling problems (ASP).
Journal ArticleDOI
A path-based greedy algorithm for multi-objective transit routes design with elastic demand
TL;DR: Numerical experiments indicate that the proposed algorithm is not only able to approximate the Pareto-optimal solutions with satisfactory accuracy, but also achieves a fast performance even for problems of real-world scale.