Abstract
In this paper we consider some extensions of the Linear Complementarity Problem, which is one of the fundamental problems in mathematical programming. More specifically we consider the Linear Dynamic Complementarity Problem (LDCP), the Generalized Linear Complementarity Problem (GLCP) and the Extended Linear Complementarity Problem (ELCP). In this note we show that the LDCP is a special case of the ELCP and the GLCP.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
