Preferred Language
Articles
/
ijs-970
Strongly and Semi Strongly E_h-b-Vex Functions: Applications to Optimization Problems
...Show More Authors

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.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Feb 01 2017
Journal Name
International Journal Of Science And Research (ijsr)
Fibrewise Soft Topological Spaces
...Show More Authors

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.

View Publication
Publication Date
Wed Apr 25 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Different Estimation Methods for System Reliability Multi-Components model: Exponentiated Weibull Distribution
...Show More Authors

        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

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
A Study on Co – odd (even) Sum Degree Edge Domination Number in Graphs
...Show More Authors

 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
View Publication Preview PDF
Scopus Clarivate Crossref