The goal of this work is to introduce the concept of interval metric in a compact way by modifying the existing definitions of interval metric. Then, a result regarding the necessary and sufficient criterion for interval metric is established. Thereafter, to illustrate the idea of interval metric, a set of examples is provided. Then, several results regarding the formation of interval metric are derived. Also, the concept of interval diameter, boundedness of a set under interval metric and interval distance are introduced. All the theoretical results are illustrated with the help of some numerical examples. Finally, as an application of interval metric, all the theoretical developments of transformation of multi-objective interval optimization problem into interval single objective optimization problem by Global criterion method, Tchebycheff method and Weighted Tchebycheff method are established.
This paper aims to introduce a new interval approach called the Semi-Type-2 interval to represent imprecise parameters in uncertain decision-making. The proposed work establishes arithmetic operations of Semi-Type-2 intervals with algebraic properties. Additionally, a new interval ranking is proposed in order to compare Semi-Type-2 interval numbers, and the corresponding properties of total order relations are also derived. All the definitions and properties related to Semi-Type-2 intervals are illustrated with the help of numerical examples. Numerical illustrations confirm the consistency of the framework and its effectiveness in extending classical interval mathematics. Finally, some probable applications of the Semi-Type-2 interval approach are demonstrated for future implementation.
Fibonacci Search Technique is one of the familiar iterative methods for solving one dimensional unconstrained optimization problem with highly non-linear/non-differentiable objective function. However, sometimes objective function becomes inexact/imprecise in nature due to the uncertainty. To deal with such imprecise problem, present article focuses on an extension of Fibonacci Search technique whose algorithm is developed based on interval order relations. In this work, first of all, two different types of optimizers (maximizer/minimizer) viz.,c-Loptimizer,c-roptimizer, of an interval valued function are introduced based on different order relations. After that a result regarding the relation between said optimizers are established. Then, Fibonacci search type algorithms are developed for all types of optimizers. Finally, the said algorithms are illustrated with a number of numerical examples.
Discovering the compactness properties in generalized-type metric spaces opens up a fascinating area of research. The present study tries to develop a theoretical framework for compactness with key properties in the recently developed interval metric space. This work begins with explaining the covers and open covers to define compact interval metric spaces and their main features. Next, a similar definition of compactness using the finite intersection property is introduced. Then, the famous Heine–Borel theorem for compactness is extended in the case of interval metric spaces. Also, the concepts of sequential-type compactness and Bolzano–Weierstrass (BW)-type compactness for interval metric spaces are introduced with their equivalency relationship. Finally, the notion of total boundedness in interval metric spaces and its connection with compactness is introduced, providing new insights into these mathematical concepts.