نتایج جستجو برای: interactive fuzzy multi objective linear programming i fmolp

تعداد نتایج: 2722043  

Bavandi, S., Cao, B. Y., Khorsandi, A.,

Nowadays Geometric Programming (GP) problem is a very popular problem in many fields. Each type of Fuzzy Geometric Programming (FGP) problem has its own solution. Sometimes we need to use the ranking function to change some part of GP to the linear one. In this paper, first, we propose a method to solve multi-objective geometric programming problem with trapezoidal fuzzy variables; then we use ...

2008
H. R. MALEKI

A non-linear multi-objective transportation problem (NMOTP) refers to a special class of non-linear multi-objective problems. In this paper we review goal programming (GP) and fuzzy programming (FP) as two approaches for solving (NMOTP). Meanwhile, by extending Mohamed’s idea about fuzzy goal programming (FGP), we propose a fuzzy goal programming approach to solve the non-linear multi-objective...

Journal: :Indian Journal of Computer Graphics and Multimedia 2021

This article is devoted to the problem of decision making under uncertainty. An aggregated approach used that combines optimization and choice a solution, which makes it possible obtain more realistic solution. The criteria in vector are: profit, product quality, employee satisfaction. To solve problem, 3 methods were used: "Goal programming", "Interactive", "FMOLP". task group implemented on b...

Journal: :international journal of industrial mathematics 0
k. lachhwani department of mathematics, government engineering college, bikaner- 334004, india.

multi objective quadratic fractional programming (moqfp) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the object...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

K. Gholami, Z. Ghelej Beigi

Data envelopment analysis (DEA) is a common technique in measuring the relative efficiency of a set of decision making units (DMUs) with multiple inputs and multiple outputs. ‎‎Standard DEA models are ‎‎quite limited models‎, ‎in the sense that they do not consider a DMU ‎‎at different times‎. ‎To resolve this problem‎, ‎DEA models with dynamic ‎‎structures have been proposed‎.‎In a recent pape...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید