We consider again the procedure for finding a solution of a linear complementarity system, which was presented in [4]. The procedure is based on the theory of the simplex method and generates iterative cuts of the relaxed system, until one of the solutions is obtained. This solution can be used in the first step of the method we have described in [6]. Some better explanatory examples are shown.

A procedure for solving a linear complementarity system

Alberto Peretti
2024-01-01

Abstract

We consider again the procedure for finding a solution of a linear complementarity system, which was presented in [4]. The procedure is based on the theory of the simplex method and generates iterative cuts of the relaxed system, until one of the solutions is obtained. This solution can be used in the first step of the method we have described in [6]. Some better explanatory examples are shown.
2024
Complementarity systems, Linear Programming, Simplex Algorithm
File in questo prodotto:
File Dimensione Formato  
wp2024n8.pdf

solo utenti autorizzati

Tipologia: Documento in Pre-print
Licenza: Non specificato
Dimensione 123.63 kB
Formato Adobe PDF
123.63 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/1148268
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact