A new simplex algorithm for interval-valued Fermatean fuzzy linear programming problems
From MaRDI portal
Publication:6659751
DOI10.1007/S40314-024-02949-3MaRDI QIDQ6659751FDOQ6659751
Authors: Rakhi Bihari, Jeevaraj S, Ajay Kumar
Publication date: 9 January 2025
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
simplex algorithmarithmetic operationscomplete ranking principleinterval-valued Fermatean fuzzy assignment probleminterval-valued fermatean fuzzy linear programming probleminterval-valued fermatean fuzzy sets
Cites Work
- Fuzzy programming and linear programming with several objective functions
- Decision-Making in a Fuzzy Environment
- Intuitionistic fuzzy sets
- Fuzzy sets
- A particular simplex algorithm to solve fuzzy lexicographic multi-objective linear programming problems and their sensitivity analysis on the priority of the fuzzy objective functions
- Optimization in an intuitionistic fuzzy environment
- More on intuitionistic fuzzy sets
- A new approach for solving fully intuitionistic fuzzy transportation problems
- Linear programming problems and ranking of fuzzy numbers
- Title not available (Why is that?)
- Duality theory in Atanassov's intuitionistic fuzzy mathematical programming problems: optimistic, pessimistic and mixed approaches
- A new algorithm to solve fully fuzzy linear programming problems using the MOLP problem
- The dual simplex method and sensitivity analysis for fuzzy linear programming with symmetric trapezoidal numbers
- Solving nonlinear multi-objective optimization problems with fuzzy relation inequality constraints regarding Archimedean triangular norm compositions
- Title not available (Why is that?)
- Fully Pythagorean fuzzy linear programming problems with equality constraints
- A method to solve linear programming problem with interval type-2 fuzzy parameters
- Interval-Valued Intuitionistic Fuzzy Linear Programming Problem
- Foundations of operations research: from linear programming to data envelopment analysis
- Optimality conditions for nonlinear optimization problems with interval-valued objective function in admissible orders
This page was built for publication: A new simplex algorithm for interval-valued Fermatean fuzzy linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659751)