Solving Fuzzy Multiobjective Linear Programming Problems Using Embedding Theorem

Fuzzy multiobjective linear programming problems are solved in this paper by considering the concepts of the minimizer and ideal minimizer. A useful embedding theorem is provided to define the partial orderings among the space of fuzzy intervals in R, where the partial orderings are generated by some convex cones. Using the partial orderings, we can propose the concept of minimal elements such that the concepts of the minimizer and ideal minimizer of fuzzy multiobjective linear programming problems can be proposed. The main issue is to separately derive the optimality conditions for the minimizer and ideal minimizer. Finally, we consider some practical problems by providing a specific convex cone such that the minimizer and ideal minimizer can be obtained by solving the conventional linear programming problems using the simplex method.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2026-02-09
DOI
https://doi.org/10.3390/sym18020313
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Solving Fuzzy Multiobjective Linear Programming Problems Using Embedding Theorem

Hsien-Chung Wu
Symmetry
Optimization and Variational Analysis
article

Solving Fuzzy Multiobjective Linear Programming Problems Using Embedding Theorem

Hsien-Chung Wu
article en

Abstract

Fuzzy multiobjective linear programming problems are solved in this paper by considering the concepts of the minimizer and ideal minimizer. A useful embedding theorem is provided to define the partial orderings among the space of fuzzy intervals in R, where the partial orderings are generated by some convex cones. Using the partial orderings, we can propose the concept of minimal elements such that the concepts of the minimizer and ideal minimizer of fuzzy multiobjective linear programming problems can be proposed. The main issue is to separately derive the optimality conditions for the minimizer and ideal minimizer. Finally, we consider some practical problems by providing a specific convex cone such that the minimizer and ideal minimizer can be obtained by solving the conventional linear programming problems using the simplex method.

SymmetryVol. 18(2)
National Kaohsiung Normal University (TW)
Openalex Percentile: Top 60%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.