A Unified Framework for a Class of Mathematical Programming Problems

Document Type

Book Chapter

Publication Title

Indian Statistical Institute Series

Abstract

In this chapter, we study various mathematical programming problems in a common framework known as linear complementarity problem. Solving a linear complementarity problem depends on the properties of its underlying matrix class. In this chapter, we discuss matrix theoretic properties of some recent matrix classes encountered in linear complementarity literature and its processability using Lemke’s algorithm.

First Page

1

Last Page

31

DOI

10.1007/978-981-13-3059-9_1

Publication Date

1-1-2018

This document is currently not available here.

Share

COinS