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

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1979
Accession Number
ADA073929

Entities

People

  • Ikuyo Kaneko
  • Jong-shi Pang

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Science
  • Consistency
  • Contracts
  • Engineering
  • Equations
  • Identities
  • Industrial Engineering
  • Military Research
  • Nonlinear Analysis
  • Reinforced Concrete
  • Schools
  • Three Dimensional
  • Transportation
  • Universities

Fields of Study

  • Mathematics

Readers

  • Control Systems Engineering.
  • Economics
  • Graph Algorithms and Convex Optimization.