Linear Complementarity Problem & Its Extensions
Date/Time: Tuesday 16:30-18:00
Cluster: Complementarity Problems
Room: John Adams
Chair: M. Seetharama Gowda
Chair Address: UMBC, Dept. of Math. & Stats., Baltimore, MD 21228 ,
Implicit Generalized Complementarity Problems & Dynamic Programming Michael M. Kostreva --- Clemson Univ., Dept. of Math. Sci., Clemson, SC 29634-1907, (email@example.com)
- The equations describing the principle of optimality for the¨ shortest route problem are equivalent to an implicit generalized¨ complementarity problem. Some observations from complementarity¨ theory and dynamic programming will be made.
The General Order Complementarity Problem George Isac --- Royal Military Coll. of Canada, Dept. of Math. & Comp. Sci., Kingston, Ontario, , Canada K7K 5L0
- We consider the general order complementarity problem defined with¨ respect to either a vector lattice or a variational structure. We¨ present several models and discuss the solvability of the problem¨ via iterative methods, a special topological index, nonexistence of¨ exceptional families of elements and global optimization.
A Note on the Uniqueness of Solutions for the Vertical Linear Complementarity Problem Aniekan A. Ebiefung --- Univ. of Tennessee, Dept. of Math., Chattanooga, TN 37403 ,
- The uniqueness of solutions for the vertical LCP is characterized by¨ solutions of LCPs defined on the representative submatrices on the¨ system. The conditions are independent of the associated matrix¨ class and provide an alternative description of the set of vertical¨ block P-matrices.