Treffer: On solving the vertical generalized linear complementarity problem associated with a vertical block P-matrix
Title:
On solving the vertical generalized linear complementarity problem associated with a vertical block P-matrix
Authors:
Source:
Masters Theses and Doctoral Dissertations
Publisher Information:
UTC Scholar
Publication Year:
2025
Collection:
University of Tennessee at Chattanooga: UTC Scholar
Subject Terms:
Document Type:
Fachzeitschrift
text
File Description:
application/pdf
Language:
English
Relation:
Availability:
Accession Number:
edsbas.8C9552B
Database:
BASE
Weitere Informationen
In Ebiefung et al. (2017) an algorithm was developed to solve the vertical generalized linear complementarity problem (VGLCP) when the associated matrix is a vertical block P-matrix (VBP). The objective of this study is to implement the algorithm on a large scale using the Python programming language. We also use a Python code to generate test VBP- matrices Ebiefung et al. (2022), and used them to implement the algorithm. On a representative example, every computational step including basis updates, pivot selection, and vector analysis is recorded. The Python implementation exhibits precise convergence. The final results verifying the correctness of the solution are checked against complementarity and feasibility requirements.