Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.22547

Bayesian fuzzy optimization using fuzzy Gaussian process

Sourav Das·Debdas Ghosh·Debjani Chakraborty·Pabitra Mitra
View original source ↗Read source document ↗Export metadata ↓

Abstract

In many real-life problems, decision-making gets complicated due to dual sources of uncertainty, known as randomness and fuzziness or imprecision, which can be challenging for traditional optimization methods. Most of the existing fuzzy optimization techniques that optimize fuzzy-valued objective functions ignore fuzziness, while the probabilistic optimization techniques ignore randomness. To handle this dual source of uncertainty, Kwakernaak introduced the concept of a fuzzy random variable as ``random variables whose values are not real, but fuzzy numbers". This work aims to derive a theoretical background for the Gaussian fuzzy process and fuzzy acquisition functions, which will be used to develop a novel \emph{Bayesian fuzzy optimization} (BFO) technique that optimizes a fuzzy-values objective function. Based on fuzzy random variables, the Gaussian fuzzy process is developed, which is used as a prior belief about the fuzzy-valued objective function in the BFO. Fuzzy acquisition functions are defined to act as a guide for the search process of BFO with the help of posterior fuzzy mean and fuzzy variance. The proposed method demonstrated effective performance in both fuzzy mean-variance portfolio allocation and Indian temperature data analysis, showing robust predictive accuracy and adaptability. The proposed method can have broader applications in various fields like healthcare, material science, agriculture, etc.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Sourav Das, Debdas Ghosh, Debjani Chakraborty, Pabitra Mitra. 2026-05-07. Bayesian fuzzy optimization using fuzzy Gaussian process. https://arxiv.org/abs/2607.22547

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗