Some Results about Set-Valued Complementarity Problem

Authors

  • Kh. Bypour Department of Mathematics, Faculty of Science, Golestan University, Gorgan, Iran
  • M. Roohi Department of Mathematics, Faculty of Science, Golestan University, Gorgan, Iran
Abstract:

This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. Our results illustrated by some examples. This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. Our results illustrated by some examples.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Generalized Strongly Set-valued Nonlinear Complementarity Problems

In this paper, we introduce a new class of generalized strongly set-valued nonlinear complementarity problems and construct new iterative algorithms. We show the existence of solutions for this kind of nonlinear complementarity problems and the convergence of iterative sequences generated by the algorithm. Our results extend some recent results in this field.

full text

Some Results on the Target Set Selection Problem

In this paper we consider a fundamental problem in the area of viral marketing, called TARGET SET SELECTION problem. We study the problem when the underlying graph is a block-cactus graph, a chordal graph or a Hamming graph. We show that if G is a block-cactus graph, then the TARGET SET SELECTION problem can be solved in linear time, which generalizes Chen’s result [2] for trees, and the time c...

full text

Some Results About Frames

In this paper we discuss some topics related to the general theory of frames. In particular we focus our attention to the existence of different ’reconstruction formulas’ for a given vector of a certain Hilbert space and to some refinement of the perturbative approach for the computation of the dual frame.

full text

Some New Existence , Sensitivity and Stability Results for the Nonlinear Complementarity Problem

In this work we study the nonlinear complementarity problem on the nonnegative orthant. This is done by approximating its equivalent variational-inequality-formulation by a sequence of variational inequalities with nested compact domains. This approach yields simultaneously existence, sensitivity, and stability results. By introducing new classes of functions and a suitable metric for performin...

full text

Some results about unbounded convergences in Banach lattices

Suppose E is a Banach lattice. A net  in E is said to be unbounded absolute weak convergent ( uaw-convergent, for short) to  provided that the net  convergences to zero, weakly.  In this note, we further investigate unbounded absolute weak convergence in E. We show that this convergence is stable under passing to and   from ideals and sublattices. Compatible with un-convergenc, we show that ...

full text

Some Duality Results in Grey Linear Programming Problem

Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 5  issue 19

pages  81- 92

publication date 1970-01-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023