Let [Formula: see text] be a commutative ring with identity. The co-maximal ideal graph of text], denoted by is simple whose vertices are proper ideals which not contained in the Jacobson radical and two distinct adjacent if only text]. In this paper, we use Gallai’s Theorem concept strong resolving to compute metric dimension for graphs rings. Explicit formulae dimension, depending on whether ...

In this paper, basing our consideration on the sets with the apartness relation, we analyze characteristics of some special relations to these sets such as co-order and co-quasiorder and coequality relations. In addition, we analyze two special classes of subsets, co-filters and co-ideals, of ordered set under a co-quasiorder relation. This investigation is into the Bishop’s Constructive mathem...

Let R be a Noetherian commutative ring containing a eld. The test ideal, introduced by Hochster and Huneke in HH1], has emerged as an important object associated to R. The test ideal can be deened as the largest ideal J of R such that JI I for all ideals I of R where I denotes the tight closure of I. Although it is not obvious that a ring R admits a non-zero test ideal, Hochster and Huneke show...

• The dual problem is always convex no matter if the primal problem is convex, i.e., g is always concave. • The primal and dual optimal values, f∗ and g∗, always satisfy weak duality: f∗ ≥ g∗. • Slater’s condition: for convex primal, if there is an x such that h1(x) < 0, · · · , hm(x) < 0 and l1(x) = 0, · · · , lr(x) = 0 (12.5) then strong duality holds: f∗ = g∗. Note that the condition can be ...

Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to obtain nice properties comparable to those of classical rough approximations. In this research paper, these ideas are generalized in a severe way by the pre...

In a recent paper [8], Chan and Sun reported for semidefinite programming (SDP) that the primal/dual constraint nondegeneracy is equivalent to the dual/primal strong second order sufficient condition (SSOSC). This result is responsible for a number of important results in stability analysis of SDP. In this paper, we study duality of this type in nonlinear semidefinite programming (NSDP). We int...

In this note first we define the notions of fuzzy positive implicativehyper BCK-ideals of types 1,2,3 and 4. Then we prove some theorems whichcharacterize the above notions according to the level subsets. Also we obtainthe relationships among these notions, fuzzy (strong, weak, reflexive) hyperBCK-ideals and fuzzy positive implicative hyper BCK-ideals of types 5,6,7and 8. Then, we define the no...

In this paper we present a robust duality theory for generalized convex programming problems in the face of data uncertainty within the framework of robust optimization. We establish robust strong duality for an uncertain nonlinear programming primal problem and its uncertain Lagrangian dual by showing strong duality between the deterministic counterparts: robust counterpart of the primal model...