Linear complementarity problems and multiple objective programming

DOI10.1007/BF01580619zbMath0796.90047MaRDI QIDQ689137

Michael M. Kostreva, Malgorzata M. Wiecek

Publication date: 26 September 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

computational complexityexistencelinear complementarityuniquenessmultiple objective programmingLemke's algorithmzero-efficient solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (9)

Unified approaches for solvable and unsolvable linear complementarity problems ⋮ Multiple-objective approximation of feasible but unsolvable linear complementarity problems ⋮ Finding a minimal efficient solution of a convex multiobjective program ⋮ A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming ⋮ Bounded homotopy path approach to the solution of linear complementarity problems ⋮ A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming ⋮ Equivalence of vertical block linear complementarity problems and multi-objective programming problems ⋮ On the upper semi-continuity of the solution map to the vertical implicit homogeneous complementarity problem of type \(R_{0}\) ⋮ Generallized Linear Complementarity Problem and Multiobjective Programming Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a particular quadratic network problem
• On efficient sets in vector maximum problems - A brief survey
• NP-completeness of the linear complementarity problem
• Parallel search algorithms in global optimization
• Lagrange multipliers and generalized differentiable functions in vector extremum problems
• Non-convexity in noncooperative game theory
• Multiple-objective programming with polynomial objectives and constraints
• Existence of efficient solutions for vector maximization problems
• Goal programming and multiple objective optimizations. Part I
• Block pivot methods for solving the complementarity problem
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• Proper efficiency and the theory of vector maximization
• The range of the efficient frontier in multiple objective linear programming
• A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
• Global Optimization Approach to the Linear Complementarity Problem
• Linear complementarity problems solvable by A single linear program
• Efficiency in multiple objective optimization problems
• On solving linear complementarity problems as linear programs
• Finding all efficient extreme points for multiple objective linear programs
• Some classes of matrices in linear complementarity theory
• Bimatrix Equilibrium Points and Mathematical Programming
• The Linear Complementarity Problem
• On Quadratic Programming

This page was built for publication: Linear complementarity problems and multiple objective programming