Work

A Problem in Probabilistic Optimization

Year: 2023
Type: preprint
Abstract: In our present discussion our target is to describe a method for determining the probabilistic distance between two sets. The approach here is through a construction of a non-self contraction from one set to the other and then seeking a global optimal approximate solution of the corresponding fixed point equation in probabilistic terms where the exact solution does not exist in general. The main theorem is illustrated with an example. The study is in the domain of probabilistic optimization.
Language: English
Open Access status: green
OpenAlex ID: W4388480928
Cites: 13
Cited by:
Related to: 10