An enumerative method for the solution of linear complementarity problems

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2312

Full metadata record

DC Field	Value	Language
dc.contributor.author	Judice, JJ	-
dc.contributor.author	Mitra, G	-
dc.coverage.spatial	34	en
dc.date.accessioned	2008-05-29T15:13:00Z	-
dc.date.available	2008-05-29T15:13:00Z	-
dc.date.issued	1983	-
dc.identifier.citation	Maths Technical Papers (Brunel University). April 1983, pp 1-29	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2312	-
dc.description.abstract	In this report an enumerative method for the solution of the Linear Complementarity Problem (LCP) is presented. This algorithm completely processes the LCP, and does not require any particular property of the LCP to apply. That is the algorithm terminates after either finding all the solutions of an LCP or establishing that no solution exists. The method is extended to also process the Second Linear Complementarity Problem (SLCP), a problem which has been introduced to represent the general quadratic program involving unrestricted variables.	en
dc.format.extent	552469 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Brunel University	en
dc.relation.ispartof	Brunel University Mathematics Technical Papers collection;	-
dc.relation.ispartofseries	;TR/04/83	-
dc.title	An enumerative method for the solution of linear complementarity problems	en
dc.type	Research Paper	en
Appears in Collections:	Dept of Mathematics Research Papers Mathematical Sciences

Files in This Item:

File	Description	Size	Format
TR_04_83.pdf		539.52 kB	Adobe PDF	View/Open