A Compromise Solution For The Fully Fuzzy Multiobjective Linear Programming Problems

Abdulqader Othman Hamadameen, Nasruddin Hassan

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A new approach is undertaken to solve the fully fuzzy multiobjective linear programming (FFMLP) problem. The coefficients of the objective functions, constraints, right hand side parameters, and variables are of the Triangular Fuzzy Number (TrFN)s. A solution strategy, called Compromise Solution Algorithm (CSA), is presented using a three-step procedure. First, a revised simplex method together with Gaussian elimination in the environment of the linear ranking function are used to convert the FFMLP problems partially into semi fully fuzzy multiobjective linear programming (SFFMLP) problems. Then, the obtained SFFMLP problems are gathered together as a single problem. Finally, the gathered problem is solved by one of four different methods to find a fuzzy compromise solution for the FFMLP problems. The CSA is then numerically applied to a FFMLP problem to illustrate the practicability of the proposed procedure.

Original languageEnglish
JournalIEEE Access
DOIs
Publication statusAccepted/In press - 3 Aug 2018

Fingerprint

Linear programming

Keywords

  • CSA
  • FFLP problem
  • FFMLP problems
  • fuzzy compromise solution
  • fuzzy simplex method
  • Gold
  • Indexes
  • Linear programming
  • linear ranking function
  • Numerical models
  • Programming
  • SFFLP problem
  • SFFMLP problems
  • simplex method and Gaussian elimination

ASJC Scopus subject areas

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

A Compromise Solution For The Fully Fuzzy Multiobjective Linear Programming Problems. / Hamadameen, Abdulqader Othman; Hassan, Nasruddin.

In: IEEE Access, 03.08.2018.

Research output: Contribution to journalArticle

@article{7c4fbf7c6dbf45d0b3f740169b78f948,
title = "A Compromise Solution For The Fully Fuzzy Multiobjective Linear Programming Problems",
abstract = "A new approach is undertaken to solve the fully fuzzy multiobjective linear programming (FFMLP) problem. The coefficients of the objective functions, constraints, right hand side parameters, and variables are of the Triangular Fuzzy Number (TrFN)s. A solution strategy, called Compromise Solution Algorithm (CSA), is presented using a three-step procedure. First, a revised simplex method together with Gaussian elimination in the environment of the linear ranking function are used to convert the FFMLP problems partially into semi fully fuzzy multiobjective linear programming (SFFMLP) problems. Then, the obtained SFFMLP problems are gathered together as a single problem. Finally, the gathered problem is solved by one of four different methods to find a fuzzy compromise solution for the FFMLP problems. The CSA is then numerically applied to a FFMLP problem to illustrate the practicability of the proposed procedure.",
keywords = "CSA, FFLP problem, FFMLP problems, fuzzy compromise solution, fuzzy simplex method, Gold, Indexes, Linear programming, linear ranking function, Numerical models, Programming, SFFLP problem, SFFMLP problems, simplex method and Gaussian elimination",
author = "Hamadameen, {Abdulqader Othman} and Nasruddin Hassan",
year = "2018",
month = "8",
day = "3",
doi = "10.1109/ACCESS.2018.2863566",
language = "English",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A Compromise Solution For The Fully Fuzzy Multiobjective Linear Programming Problems

AU - Hamadameen, Abdulqader Othman

AU - Hassan, Nasruddin

PY - 2018/8/3

Y1 - 2018/8/3

N2 - A new approach is undertaken to solve the fully fuzzy multiobjective linear programming (FFMLP) problem. The coefficients of the objective functions, constraints, right hand side parameters, and variables are of the Triangular Fuzzy Number (TrFN)s. A solution strategy, called Compromise Solution Algorithm (CSA), is presented using a three-step procedure. First, a revised simplex method together with Gaussian elimination in the environment of the linear ranking function are used to convert the FFMLP problems partially into semi fully fuzzy multiobjective linear programming (SFFMLP) problems. Then, the obtained SFFMLP problems are gathered together as a single problem. Finally, the gathered problem is solved by one of four different methods to find a fuzzy compromise solution for the FFMLP problems. The CSA is then numerically applied to a FFMLP problem to illustrate the practicability of the proposed procedure.

AB - A new approach is undertaken to solve the fully fuzzy multiobjective linear programming (FFMLP) problem. The coefficients of the objective functions, constraints, right hand side parameters, and variables are of the Triangular Fuzzy Number (TrFN)s. A solution strategy, called Compromise Solution Algorithm (CSA), is presented using a three-step procedure. First, a revised simplex method together with Gaussian elimination in the environment of the linear ranking function are used to convert the FFMLP problems partially into semi fully fuzzy multiobjective linear programming (SFFMLP) problems. Then, the obtained SFFMLP problems are gathered together as a single problem. Finally, the gathered problem is solved by one of four different methods to find a fuzzy compromise solution for the FFMLP problems. The CSA is then numerically applied to a FFMLP problem to illustrate the practicability of the proposed procedure.

KW - CSA

KW - FFLP problem

KW - FFMLP problems

KW - fuzzy compromise solution

KW - fuzzy simplex method

KW - Gold

KW - Indexes

KW - Linear programming

KW - linear ranking function

KW - Numerical models

KW - Programming

KW - SFFLP problem

KW - SFFMLP problems

KW - simplex method and Gaussian elimination

UR - http://www.scopus.com/inward/record.url?scp=85051041678&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85051041678&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2018.2863566

DO - 10.1109/ACCESS.2018.2863566

M3 - Article

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

ER -