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

In this paper, Multi-objective Programming (MOP) approaches are proposed to deal with the feasible Vertical Block Linear Complementarity Problems (VLCP) and to look into the solvability and unsolvability of the VLCP. The characterization of an unsolvable VLCP is obtained via the existence of nonzero...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of information & optimization sciences Ročník 31; číslo 2; s. 245 - 255
Hlavní autori: Chakraborty, B., Biswal, M.P., Nanda, S.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Delhi Taylor & Francis Group 01.03.2010
Taru Publications
Predmet:
efficient solution
Mathematical programming
minimax optimization problem
multi-objective programming problem
Optimization algorithms
Problem solving
Studies
Vertical-block linear complementarity problem
weighted problem
ISSN:0252-2667, 2169-0103
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, Multi-objective Programming (MOP) approaches are proposed to deal with the feasible Vertical Block Linear Complementarity Problems (VLCP) and to look into the solvability and unsolvability of the VLCP. The characterization of an unsolvable VLCP is obtained via the existence of nonzero efficient point of the MOP problem. Also a perturbed problem is proposed if the VLCP is unsolvable for small disturbances in data. This perturbed problem is useful to construct the solvable VLCP corresponding to the original unsolvable VLCP. Examples are given to demonstrate the effectiveness of the results.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0252-2667
2169-0103
DOI:10.1080/02522667.2010.10699957