Storming Media: Pentagon Reports and DocumentsPentagon Reports: Fast. Definitive. Complete.     
New Account »
Forgot Password?
Advanced Search »
Math and StatisticsTheoretical Mathematics

Some n by dn Linear Complementarity Problems Solvable by a Principal Pivoting Algorithm with Applications.

Authors: Ikuyo Kaneko; Jong-Shi Pang; CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Abstract:
The purpose of this paper is to study some recent applications of the n by dn LCP solvable by a parametric principal pivoting algorithm (PPP algorithm). First, it is shown that by analyzing the n by dn LCP we could study the problem of solving a system of equations and the (nonlinear) complementarity problem when the function involved is separable. Next, we examine conditions under which the PPP algorithm is applicable to a general LCP, and then present examples of LCP's arising from various applications satisfying the conditions; included among them is the n by dn LCP with a certain P-property. Finally we study a special class of n by dn LCP's which do not possess the P-property but to which the PPP algorithm is still applicable; a major application of this class of problems is a certain economic spatial equilibrium model with piecewise linear prices. (Author)

Description: Management sciences research rept.
Pages: 39
Report Date: APR 1979
Contract Number: N0001475C0621, NSFENG7711136
Report Number: A929370

Report Unavailable

This title is unavailable from Storming Media. We do not know when it might be available, if at all. We list the report on our site for bibliographic completeness, to help our users know what other work has been performed in this field. Please note that as with all titles on this site, we do not have contact information for any of the authors. Nor can we give any suggestions on how one might obtain this report.
Keywords relating to this report:
*LINEAR PROGRAMMING
ALGORITHMS
MATRICES_MATHEMATICS_
NETWORK ANALYSIS_MANAGEMENT_
Email This Abstract