{"id":{"repo_id":"utc","oai_identifier":"oai:scholar.utc.edu:theses-2205"},"canonical_url":"https://search.dev.ndltd.org/etd/utc/oai:scholar.utc.edu:theses-2205","repository":{"repo_id":"utc","name":"University of Tennessee - Chattanooga","base_url":"https://scholar.utc.edu/do/oai/"},"display":{"title":"On solving the vertical generalized linear complementarity problem associated with a vertical block P-matrix","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Horlu, Mark K"],"institution":"University of Tennessee at Chattanooga","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Aniekan, Ebiefung","Weerasena, Lakmali; Kong, Lingju; Cetinkaya, Fatma Ayca","College of Arts and Sciences"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-07-24T05:47:28Z","subjects":["Linear complementarity problem","Matrices","Python (Computer program language)"],"languages":["English","eng"],"rights":[],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://scholar.utc.edu/theses/1025","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Aniekan, Ebiefung","Weerasena, Lakmali; Kong, Lingju; Cetinkaya, Fatma Ayca","College of Arts and Sciences"]},{"key":"dc:creator","label":"Author","values":["Horlu, Mark K"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-12-01T08:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["University of Tennessee at Chattanooga","Chattanooga (Tenn.)"]},{"key":"dc:relation","label":"Dc Relation","values":["Masters Theses and Doctoral Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Masters theses","Text"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Linear complementarity problem","Matrices","Python (Computer program language)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholar.utc.edu/theses/1025"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Dept. of Mathematics","M. S.; A thesis submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Master of Science."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["On solving the vertical generalized linear complementarity problem associated with a vertical block P-matrix"]}]}],"canonical_facts":{"dc:contributor":["Aniekan, Ebiefung","Weerasena, Lakmali; Kong, Lingju; Cetinkaya, Fatma Ayca","College of Arts and Sciences"],"dc:creator":["Horlu, Mark K"],"dc:date":["2025-12-01T08:00:00Z"],"dc:description":["Dept. of Mathematics","M. S.; A thesis submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Master of Science."],"dc:description.abstract":["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."],"dc:identifier":["https://scholar.utc.edu/theses/1025"],"dc:language":["English","eng"],"dc:publisher":["University of Tennessee at Chattanooga","Chattanooga (Tenn.)"],"dc:relation":["Masters Theses and Doctoral Dissertations"],"dc:rights":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Linear complementarity problem","Matrices","Python (Computer program language)"],"dc:title":["On solving the vertical generalized linear complementarity problem associated with a vertical block P-matrix"],"dc:type":["Masters theses","Text"]},"updated_at":"2026-07-24T05:47:28Z"}