PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 14, 2026Symmetry0 citationsOpen Access

On Solving Certain Functional Equations of Dynamic Programming in Relational-Metric Space Through a Non-Unique Fixed-Point Theorem

View Full Paper
DFDoaa FilaliEAEsmail AlshabanAAAdel Alatawi

Key Points

  • The main aim is to explore the solvability of functional equations in dynamic programming via fixed-point theorems.
  • Introduces a non-unique fixed-point finding for a map of the Ćirić type in relational-metric space.
  • Exhibits theoretical results related to fixed-point theory.
  • Shows specific cases demonstrating the practical value of the findings.
  • Consolidates previous results in fixed-point theory.

Abstract

This article aims to describe the solvability of certain functional equations related to dynamic programming by fixed-point theorems in relational-metric spaces. To achieve our goal, we exhibit a non-unique fixed-point finding for a map of the Ćirić type in a relational-metric space. In this way, we consolidate and amend innumerable celebrated results in fixed-point theory. A couple of instances are supplied to emphasize the practical value of our findings.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Filali et al. (2026) studied this question.

synapsesocial.com/papers/69b4b9eb18185d8a39802232https://doi.org/10.3390/sym18030486
Ask AI
Helpful
Bookmark
Share
View Full Paper