Abstract
The question of relaxing the compatible hypothesis of the pair of mappings in fixed point theory has always been remained an open problem. We address such an open problem raised by Choudhury et al. [4] and also explicitly settles the issue of monotone and continuity hypotheses of the involved mappings in coupled coincidence point results. Moreover, we state a gap in an example given in [3] and repair it. Application to the dynamic programming problem shows the usability of present work. Finally, we also propose an open problem for further investigation.
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.
