Equivalence of vertical block linear complementarity problems and multi-objective programming problems

DOI10.1080/02522667.2010.10699957zbMath1223.90068MaRDI QIDQ3002333

Bidushi Chakraborty, Sudarsan Nanda, Mahendra Prasad Biswal

Publication date: 20 May 2011

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2010.10699957

zbMATH Keywords

efficient solution; minimax optimization problem; weighted problem

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear complementarity problems and multiple objective programming
• Unified approaches for solvable and unsolvable linear complementarity problems
• A note on linear complementarity problems and multiple objective programming
• Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem
• Multiple-objective approximation of feasible but unsolvable linear complementarity problems
• On solving linear complementarity problems as linear programs
• Generallized Linear Complementarity Problem and Multiobjective Programming Problem
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• A generalization of the linear complementarity problem