Revisiting Karnik-Mendel algorithms in the framework of linear fractional programming

DOI10.1016/j.ijar.2016.11.019zbMath1404.68166OpenAlexW2558651255MaRDI QIDQ511623

Tufan Kumbasar

Publication date: 22 February 2017

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2016.11.019

zbMATH Keywords

linear fractional programmingKarnik-Mendel algorithmstype reductioncentroid calculationDinkelbach's algorithmtype-2 fuzzy sets and systems

Mathematics Subject Classification ID

Fractional programming (90C32) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (3)

Study on reasonable initialization enhanced Karnik-Mendel algorithms for centroid type-reduction of interval type-2 fuzzy logic systems ⋮ A fast analytical approximation type-reduction method for a class of spiked concave type-2 fuzzy sets ⋮ Study on centroid type-reduction of interval type-2 fuzzy logic systems based on noniterative algorithms

Cites Work

• Unnamed Item
• Algorithms for generalized fractional programming
• Rate of convergence of a generalization of Newton's method
• Fuzzy weighted average: The linear programming approach via Charnes and Cooper's rule
• Accuracy and complexity evaluation of defuzzification strategies for the discretised interval type-2 fuzzy set
• Combinatorial Optimization with Rational Objective Functions
• Equivalence of various linearization algorithms for linear fractional programming
• Programming with linear fractional functionals
• On Nonlinear Fractional Programming
• Centroid of a type-2-fuzzy set

This page was built for publication: Revisiting Karnik-Mendel algorithms in the framework of linear fractional programming