Multiple-objective approximation of feasible but unsolvable linear complementarity problems

DOI10.1007/BF02192086zbMath0838.90120OpenAlexW1983963244MaRDI QIDQ1905039

Yanyan Li

Publication date: 16 January 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192086

zbMATH Keywords

linear complementarityefficient pointsmultiple-objectiveperturbation approaches

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 (8)

Unified approaches for solvable and 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 ⋮ On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method ⋮ A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming ⋮ Equivalence of vertical block linear complementarity problems and multi-objective programming problems ⋮ Continuous-time shortest path problems with stopping and starting costs ⋮ Exceptional families of elements, feasibility and complementarity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear complementarity problems and multiple objective programming
• Theory of multiobjective optimization
• Insoluble multicriteria linear programming problems
• Multiple-objective programming with polynomial objectives and constraints
• Vector optimization and generalized Lagrangian duality
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
• An approach to the analysis of improper problems of linear programming
• Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem
• Bimatrix Equilibrium Points and Mathematical Programming

This page was built for publication: Multiple-objective approximation of feasible but unsolvable linear complementarity problems