a concept of weak $f$-property for a set-valued mapping is introduced‎, ‎and then under some suitable assumptions‎, ‎which do not involve any information‎ ‎about the solution set‎, ‎the lower semicontinuity of the solution mapping to‎ ‎the parametric‎ ‎set-valued vector equilibrium-like problems are derived by using a density result and scalarization method‎, ‎where the‎ ‎constraint set $k$...

Ranked set sampling was introduced by McIntyre (1952, Australian Journal of Agricultural Research, 3, 385-390) as a cost-effective method of selecting data if observations are much more cheaply ranked than measured. He proposed its use for estimating the population mean when the distribution of the data was unknown. In this paper, we examine the advantage, if any, that this method of sampling h...

A concept of weak $f$-property for a set-valued mapping is introduced‎, ‎and then under some suitable assumptions‎, ‎which do not involve any information‎ ‎about the solution set‎, ‎the lower semicontinuity of the solution mapping to‎ ‎the parametric‎ ‎set-valued vector equilibrium-like problems are derived by using a density result and scalarization method‎, ‎where the‎ ‎constraint set $K$...

In this paper, we establish a proof for  a  necessary condition for  multiple objective fractional programming. In order to derive the set of necessary conditions, we employ an equivalent parametric problem. Also, we  present the related semi parametric model.

Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set family, with any subset of a universe as its parameter, to connect rough sets and matroids. On the one hand, for a universe and an equivalence relation on the u...

We present an implementation of an answer-set programming paradigm, called aspps (short for answer-set programming with propositional schemata). The system aspps is designed to process PS +-theories. It consists of two basic modules. The first module, psgrnd, grounds an PS +-theory. The second module, referred to as aspps, is a solver. It computes models of ground PS +-theories.