Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
