Abstract
Rough set theory, presented by Pawlak in 1981, is one of the most well-known methods for communicating ambiguity by estimating an item based on some knowledge rather than membership. The concept of a rough function and its convexity and differentiability in regard to its boundary region are discussed in this work. The boundary notion is also used to present a new form of rough programming issue and its solutions. Finally, numerical examples are provided to demonstrate the proposed method and emphasize its advantages over other approaches.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
