It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
In this work, we present a novel approach for resolving a fuzzy single-objective function with fuzzy constraints. The algorithm of the method is based on the null set concept and is focused on minimizing cases. With the null set concept, two partial subtraction orders for fuzzy numbers have been defined, namely simple subtraction and the Hukuhara difference. That allows us to define, respectively, optimal solutions and H-optimal solutions. First, the initial optimization problem is transformed into a deterministic, nonlinear, bi-objective optimization problem. Then, Karush Kuhn Tucker's (KKT) optimality conditions are applied to find deterministic optimal solutions. Finally, a few fuzzy algebraic operations are employed to transform deterministic optimal solutions into fuzzy optimal solutions for the initial solutions. In order to demonstrate the effectiveness of the approach, we have dealt with eleven test problems from the literature. Our method has been compared to those of other methods, and our method is at least the best in each instance.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer