Convex and Concave Hypersoft Sets with Some Properties

Abstract

Convexity plays an imperative role in optimization, pattern classification and recognition, image
processing and many other relating topics in different fields of mathematical sciences like operation research,
numerical analysis etc. The concept of soft sets was first formulated by Molodtsov as a completely new mathematical tool for solving problems dealing with uncertainties. Smarandache conceptualized hypersoft set as a
generalization of soft set (hS, E) as it transforms the function hS into a multi-attribute function hHS. Deli
introduced the concept of convexity cum concavity on soft sets to cover above topics under uncertain scenario.
In this study, a theoretic and analytical approach is employed to develop a conceptual framework of convexity
cum concavity on hypersoft set which is generalized and more effective concept to deal with optimization relating problems. Moreover, some generalized properties like δ-inclusion, intersection and union, are established.
The novelty of this work is maintained with the help of illustrative examples and pictorial version first time in
literature.