Revisiting Karnik-Mendel algorithms in the framework of linear fractional programming
From MaRDI portal
(Redirected from Publication:511623)
Recommendations
- A Survey of Continuous Karnik–Mendel Algorithms and Their Generalizations
- Weighted Karnik-Mendel algorithms to calculate the centroids of interval type-2 fuzzy sets
- Study on enhanced Karnik-Mendel algorithms: initialization explanations and computation improvements
- Centroid of an interval type-2 fuzzy set. Re-formulation of the problem
- Study on reasonable initialization enhanced Karnik-Mendel algorithms for centroid type-reduction of interval type-2 fuzzy logic systems
Cites work
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- Accuracy and complexity evaluation of defuzzification strategies for the discretised interval type-2 fuzzy set
- Algorithms for generalized fractional programming
- Centroid of a type-2-fuzzy set
- Combinatorial Optimization with Rational Objective Functions
- Equivalence of various linearization algorithms for linear fractional programming
- Fuzzy weighted average: The linear programming approach via Charnes and Cooper's rule
- On Nonlinear Fractional Programming
- Programming with linear fractional functionals
- Rate of convergence of a generalization of Newton's method
Cited in
(4)- scientific article; zbMATH DE number 4027204 (Why is no real title available?)
- 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
- Study on reasonable initialization enhanced Karnik-Mendel algorithms for centroid type-reduction of interval type-2 fuzzy logic systems
This page was built for publication: Revisiting Karnik-Mendel algorithms in the framework of linear fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511623)