A new dominance relation is defined in set-valued information system based on similarity grade of attribute value sets the problem of attribute reduction and the judgment in set-valued information system are studied, from which a new approach to attribute reductions is provided in set-valued information system, and the influence of similarity level on attribute reduction are discussed..

In this work, we use a notion of convexificator [25] together with the support function [3, 4, 15, 16, 41] to establish necessary optimality conditions for set valued bilevel optimization problems. Fortunately, the Lipschitz property of a set-valued mapping is conserved for its support function. An intermediate set-valued optimization problem is introduced to help us in our investigation.

In this paper, we consider the problem of approximate solutions of set-valued stochastic differential equations. We firstly prove an inequality of set-valued Itô integrals, which is related to classical Itô isometry, and an inequality of set-valued Lebesgue integrals. Both of the inequalities play an important role to discuss set-valued stochastic differential equations. Then we mainly state th...

In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity and algebraic equations within the dynamics model. Two primary sources of stability and accuracy problems in prior time stepping schemes for differential complementarity models of multibody systems are the use of polyhedra...

In this paper, we propose a new linear complementarity problem named as bi-linear complementarity problem (BLCP) and the method for solving BLCP. In addition, the algorithm for error estimation of BLCP is also given. Numerical experiments show that the algorithm is efficient. Keywords—Bi-linear complementarity problem, Linear complementarity problem, Extended linear complementarity problem, Err...

In this paper, we present a new path-following interior-point algorithm for *( ) P κ -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, (1 ) log n O n κ ε   +     , which is as ...

In this paper an eigenvalue complementarity problem (EiCP) is studied, which finds its origins in the solution of a contact problem in mechanics. The EiCP is shown to be equivalent to a Nonlinear Complementarity Problem, a Mathematical Programming Problem with Complementarity Constraints and a Global Optimization Problem. A finite Reformulation–Linearization Technique (RLT)-based tree search al...

In this paper the Eigenvalue Complementarity Problem (EiCP) with real symmetric matrices is addressed. It is shown that the symmetric (EiCP) is equivalent to finding an equilibrium solution of a differentiable optimization problem in a compact set. A necessary and sufficient condition for solvability is obtained which, when verified, gives a convenient starting point for any gradient-ascent loc...

This paper contributes to a deeper understanding of the link between a now conventional framework in hierarchical optimization spread under the name of the optimistic bilevel problem and its initial more difficult formulation that we call here the original optimistic bilevel optimization problem. It follows from this research that, although the process of deriving necessary optimality condition...

This paper contributes to a deeper understanding of the link between a now conventional framework in hierarchical optimization spread under the name of the optimistic bilevel problem and its initial more difficult formulation that we call here the original optimistic bilevel optimization problem. It follows from this research that, although the process of deriving necessary optimality condition...