A relaxed cutting plane algorithm for solving fuzzy inequality systems

DOI10.1080/02331939908844428zbMath0956.90066OpenAlexW1970369982MaRDI QIDQ4265518

Cheng-Feng Hu, Shu-Cherng Fang

Publication date: 22 September 1999

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939908844428

zbMATH Keywords

fuzzy programmingcutting-plane methodsystems of fuzzy inequalities

Mathematics Subject Classification ID

Related Items (2)

Linear semi-infinite programming theory: an updated survey ⋮ Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions

Cites Work

• A smooth method for the finite minimax problem
• A solution algorithm for fuzzy linear programming with piecewise linear membership functions
• Fuzzy mathematical programming. Methods and applications
• On the entropic regularization method for solving min-max problems with applications
• Solving min-max problems and linear semi-infinite programs
• Semi-Infinite Programming: Theory, Methods, and Applications
• A cutting-plane method for quadratic semi infinite programming problems
• An Efficient Method to Solve the Minimax Problem Directly
• Numerical treatment of a class of semi‐infinite programming problems
• Convex Analysis
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A relaxed cutting plane algorithm for solving fuzzy inequality systems