On solving the vertical generalized linear complementarity problem associated with a vertical block P-matrix

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.

Grantor dc:publisher

University of Tennessee at Chattanooga

Author dc:creator

• Horlu, Mark K

Contributors dc:contributor

• Aniekan, Ebiefung
• Weerasena, Lakmali; Kong, Lingju; Cetinkaya, Fatma Ayca
• College of Arts and Sciences

• Linear complementarity problem
• Matrices
• Python (Computer program language)

Licence

• http://rightsstatements.org/vocab/InC/1.0/

Language dc:language

English, eng

Repository record dc:identifier

https://scholar.utc.edu/theses/1025

OAI identifier oai:identifier

oai:scholar.utc.edu:theses-2205