Using fuzzy bases to resolve nonlinear programming problems (Q1595197): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stability analysis of multicriteria LP problems with fuzzy parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision-Making in a Fuzzy Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint solution to fuzzy programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability on multiobjective linear programming problems with fuzzy parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive theory for fuzzy systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2771612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latticized linear programming and fuzzy relation inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy programming and linear programming with several objective functions / rank
 
Normal rank

Latest revision as of 14:23, 3 June 2024

scientific article
Language Label Description Also known as
English
Using fuzzy bases to resolve nonlinear programming problems
scientific article

    Statements

    Using fuzzy bases to resolve nonlinear programming problems (English)
    0 references
    0 references
    11 February 2001
    0 references
    The concept of a fuzzy basis is introduced as a special fuzzy granulation of a given real interval. Theoretical properties of fuzzy bases are derived and the concept of a fuzzy linear basis is defined. It is shown how to use fuzzy linear bases for solving nonconvex optimization problems. In the further part of the article, fuzzy bases are used in fuzzy interpolation. It is shown that any continuous differentiable function defined on the one-dimensional real space can be approximated by fuzzy linear interpolation to any given accuracy. It is shown how to transform general nonconvex programming problems to a mixed integer bilinear form using fuzzy interpolation. If the objective function is convex, then the problem can be relaxed by making use of the fuzzy bases to an ordinary linear programming problem. Simplifying cutting methods for solving the nonlinear problems are suggested.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fuzzy linear bases
    0 references
    nonconvex optimization
    0 references
    fuzzy bases
    0 references
    fuzzy interpolation
    0 references
    nonconvex programming
    0 references