Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization

DOI10.1016/S0165-0114(02)00254-3zbMath1026.90107MaRDI QIDQ1874064

G. William Walster, Vladik Ya. Kreinovich

Publication date: 22 May 2003

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

zbMATH Keywords

Fuzzy optimizationInterval analysisCrude range testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) General methods in interval analysis (65G40) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• INTOPT_90

Cites Work

• Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation
• A new polynomial-time algorithm for linear programming
• A note on the extension principle for fuzzy sets
• Linear programming: foundations and extensions
• Rigorous global search: continuous problems
• Computational complexity and feasibility of data processing and interval computations
• Decision-Making in a Fuzzy Environment
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization