On solving multiobjective quadratic programming problems in a probabilistic fuzzy environment

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a fuzzy goal programming (FGP) approach for solving fuzzy multiobjective quadratic chance-constrained programming (CCP) problem involving exponentially distributed fuzzy random variables (FRVs) is developed. In the proposed methodology, the problem is first converted into interval-valued quadratic programming problem using CCP technique and α-cut of fuzzy numbers. Then, using fuzzy partial order relations, the problem is converted into its equivalent deterministic form. The individual optimal value of each objective is found in isolation to construct the quadratic fuzzy membership goals of each of the objective. The quadratic membership goals are transferred into linear goals by applying piecewise linear approximation technique. A minsum goal programming (GP) method is then applied to both the linearized and quadratic model to achieve the highest membership degree of each of the membership goals in the decision-making context. Finally, a comparison is made on the two different approaches with the help of distance function. An illustrative numerical example is provided to demonstrate the applicability of the proposed methodology.

Cite

CITATION STYLE

APA

Biswas, A., & De Kumar, A. (2015). On solving multiobjective quadratic programming problems in a probabilistic fuzzy environment. In Advances in Intelligent Systems and Computing (Vol. 335, pp. 543–557). Springer Verlag. https://doi.org/10.1007/978-81-322-2217-0_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free