Interval-Valued Multiobjective Programming Problems Based on Convex Cones

The new solution concepts of interval-valued multiobjective optimization problems using ordering cone are proposed in this paper. An equivalence relation is introduced to divide the collection of all bounded closed intervals into the equivalence classes. The family of all equivalence classes is also...

Full description

Saved in:
Bibliographic Details
Published in:Symmetry (Basel) Vol. 16; no. 9; p. 1120
Main Author: Wu, Hsien-Chung
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.09.2024
Subjects:
Equivalence
Fuzzy sets
Intervals
Investment analysis
Linear programming
Mathematical programming
Multiple objective analysis
Multiplication
Optimization
Pareto optimization
Pareto optimum
Quadratic programming
Quotients
Random variables
Vector spaces
ISSN:2073-8994, 2073-8994
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The new solution concepts of interval-valued multiobjective optimization problems using ordering cone are proposed in this paper. An equivalence relation is introduced to divide the collection of all bounded closed intervals into the equivalence classes. The family of all equivalence classes is also called a quotient set. In this case, this quotient set can turn into a vector space under some suitable settings for vector addition and scalar multiplication. The notions of ordering cone and partial ordering on a vector space are essentially equivalent. It means that an ordering in the quotient set can be defined to study the Pareto optimal solution in multiobjective optimization problems. In this paper, we consider the multiobjective optimization problem such that its coefficients are taken to be the bounded closed intervals. With the help of the convex cone, we can study the Pareto optimal solutions of the multiobjective optimization problem with interval-valued coefficients.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2073-8994
2073-8994
DOI:10.3390/sym16091120