In this paper, we propose new types of non-convex functions called strongly --vex functions and semi strongly --vex functions. We study some properties of these proposed functions. As an application of these functions in optimization problems, we discuss some optimality properties of the generalized nonlinear optimization problem for which we use, as an objective function, strongly --vex function and semi strongly --vex function.
In this paper, the reliability of the stress-strength model is derived for probability P(Y<X) of a component having its strength X exposed to one independent stress Y, when X and Y are following Gompertz Fréchet distribution with unknown shape parameters and known parameters . Different methods were used to estimate reliability R and Gompertz Fréchet distribution parameters, which are maximum likelihood, least square, weighted least square, regression, and ranked set sampling. Also, a comparison of these estimators was made by a simulation study based on mean square error (MSE) criteria. The comparison confirms that the performance of the maximum likelihood estimator is better than that of the other estimators.
Soft closure spaces are a new structure that was introduced very recently. These new spaces are based on the notion of soft closure operators. This work aims to provide applications of soft closure operators. We introduce the concept of soft continuous mappings and soft closed (resp. open) mappings, support them with examples, and investigate some of their properties.
In this essay, we utilize m - space to specify mX-N-connected, mX-N-hyper connected and mX-N-locally connected spaces and some functions by exploiting the intelligible mX-N-open set. Some instances and outcomes have been granted to boost our tasks.
The primary purpose of this subject is to define new games in ideal spaces via set. The relationships between games that provided and the winning and losing strategy for any player were elucidated.
The production companies in the Iraqi industry environment facing many of the problems related to the management of inventory and control In particular in determining the quantities inventory that should be hold it. Because these companies adoption on personal experience and some simple mathematical methods which lead to the identification of inappropriate quantities of inventory.
This research aims to identify the economic quantity of production and purchase for the Pepsi can 330ml and essential components in Baghdad soft drinks Company in an environment dominated by cases of non ensure and High fluctuating as a result of fluctuating demand volumes and costs ass
... Show MoreIn this work we explain and discuss new notion of fibrewise topological spaces, calledfibrewise soft ideal topological spaces, Also, we show the notions of fibrewise closed soft ideal topological spaces, fibrewise open soft ideal topological spaces and fibrewise soft near ideal topological spaces.
In this work we define and study new concept of fibrewise topological spaces, namely fibrewise soft topological spaces, Also, we introduce the concepts of fibrewise closed soft topological spaces, fibrewise open soft topological spaces, fibrewise soft near compact spaces and fibrewise locally soft near compact spaces.
In this paper, estimation of system reliability of the multi-components in stress-strength model R(s,k) is considered, when the stress and strength are independent random variables and follows the Exponentiated Weibull Distribution (EWD) with known first shape parameter θ and, the second shape parameter α is unknown using different estimation methods. Comparisons among the proposed estimators through Monte Carlo simulation technique were made depend on mean squared error (MSE) criteria
An edge dominating set of a graph is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G. The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin
... Show More