Abstract
This paper is about a special class of semi-infinite linear programs and its relationship with fuzzy set programming. In particular, a certain type of convex fuzzy set program is shown to belong to a class of semi-infinite programs characterized by the fact that only one point exists where the constraint inequality is binding at a non-zero optimum. Solution strategies and examples are given both for the semi-infinite program and the fuzzy set program.KeywordsMembership FunctionConstraint InequalityComplementary SlacknessInfinite ProgramApproximate Linear ProgramThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
