Book•
Linear complementarity, linear and nonlinear programming
01 Jan 1988-
About: The article was published on 1988-01-01 and is currently open access. It has received 1012 citations till now. The article focuses on the topics: Mixed complementarity problem & Complementarity theory.
Citations
More filters
TL;DR: In this paper, a new statistical approach to monitoring industrial injuries on an operation is presented, which can be used by practitioners to determine if the incidence rate on an industrial operation is out of control with respect to an acceptable rate as a function of injury severity and redesign costs.
Abstract: This paper develops a new statistical approach to monitoring industrial injuries on an operation. It details a sequential procedure which can be used by practitioners to determine if the incidence rate on an operation is “out of control” with respect to an acceptable rate as a function of injury severity and redesign costs. The procedure is based upon the CUSUM test for the exponential distribution. Test implementation, sensitivity, and robustness are also discussed.
1 citations
Journal Article•
TL;DR: A brief survey of the results in linear complementarity theory is presented, using the conceptof the degree of a suitably constructed piecewise linear map Local and global degrees of an LCP map are quiteuseful in identifying subclasses of and Qo-matrices as discussed by the authors.
Abstract: In this paper, a brief survey of some of the results in linear complementarity theory is presented, using the conceptof the degree of a suitably constructed piecewise linear map Local and global degrees of an LCP map are quiteuseful in identifying subclasses of and Qo-matrices Some of the well-known characterizations of these classesare given a newer perspective in terms of degree theory The class of superfluous matrices defined using globaldegree is highlighted with relevant examples Properties of a simplicial polytope relating to an LCP map are of usein global degree analysis One of the sections here deals with these results Finally, the use of degree theory in thestudy of sensitivity and solution stability of linear complementarity problems is brought out
1 citations
Cites background from "Linear complementarity, linear and ..."
...The vectors q° = (1, 2)' and q 1 = ( — 2, — 1)' lie in two different connected components of R2\ C....
[...]
...Also, if there is only one connected component of nf(d(2), then the local degree of f is the same for all y E and is called the global degree off It is denoted by deg f....
[...]
...(Homotopy invariance property): If H(t, x) is a continuous function for (t,x) EOM x 12 and if y e H(t,d(2) for all t E [0,1], then...
[...]
Dissertation•
01 Jan 2014
1 citations
01 Jan 2007
TL;DR: In this paper, an infeasible interior point method was proposed to solve the monotone linear complementarity problem, and the results obtained in (LP) and (CQP) were extended to (LCP).
Abstract: Linear complementarity problem noted (LCP) becames in present the subject of many reseach interest because it arises in many areas and it includes the two important domains in optimization:the linear programming (LP) and the convex quadratic (CQP) programming. So the researchers aims to extend the results obtained in (LP) and (CQP) to (LCP). Differents classes of methods are proposed to solve (LCP) inspired from (LP) and (CQP). In this paper, we present an infeasible interior point method to solve the monotone linear complementarity problem. Comparative results of this method with feasible interior point method are reported. Mathematics Subject Classifications: 90C33, 90C51
1 citations
01 Jan 2008
TL;DR: The Coverage Set Algorithm is reformed and an effective way to automatically reduce the complexity of the interaction is proposed, which is both easy to implement and widely applicable to a variety of other AI problems.
Abstract: Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm and derive an online error bound for approximate solutions. Moreover, we propose an effective way to automatically reduce the complexity of the interaction. Our experiments show that this is a promising approach to solve a broad class of decentralized decision problems. The general formulation used by the algorithm makes it both easy to implement and widely applicable to a variety of other AI problems.
1 citations
Cites background from "Linear complementarity, linear and ..."
...(2), modeling it as a linear complementarity problem (Murty 1988) or a mixed integer linear program (Petrik & Zilberstein 2007)....
[...]
...(2) can also be modeled as a linear complementarity problem (LCP) (Murty 1988), we do not evaluate that option experimentally because LCPs are closely related to MILPs (Rosen 1986)....
[...]