This paper presents a fuzzy goal programming procedure to solve multiobjective quadratic bilevel programming problems, where all the parameters involved in objectives of each level decision maker and in system constra...
详细信息
ISBN:
(纸本)9781467357869;9781467357876
This paper presents a fuzzy goal programming procedure to solve multiobjective quadratic bilevel programming problems, where all the parameters involved in objectives of each level decision maker and in system constraints are fuzzily defined. In model formulation process the fuzzy numbers associated with the parameters are described by using the concept of alpha-cut of fuzzy numbers. Then the model is decomposed on the basis of the tolerance limits of fuzzy numbers. Individual decision at each objective at each level is found in isolation to find the fuzzy goals of the objectives. Then a fuzzy goal programming model is developed to minimize the group regret of degree of satisfactions of both the decision makers and to achieve the highest degree (unity) of each of the membership goals for overall benefit of the organization. In the decision process Taylor's series linear approximation technique is applied to make the quadratic membership goals to its equivalent linear form. To establish the efficiency of the proposed approach a numerical example is solved.
The existence of a decision situation is postulated in which there are p resources to be allocated so that satisfactory levels for q objective functions can be attained. This paper considers a decision situation in th...
详细信息
The existence of a decision situation is postulated in which there are p resources to be allocated so that satisfactory levels for q objective functions can be attained. This paper considers a decision situation in the reclamation and management of lands that have been strip-mined for coal. A multiobjective, stochastic technique labeled PROTRADE is suggested to help a decision maker achieve satisfactory levels for several objective functions. Risk enters the problem in the form of random variables in the objective functions. The emphasis is in the development of non normal dctcrministic equivalents for use in multiobjective techniques such as Protrade.
A new technique for solving fuzzy multiobjective chance constrained programming problems associated with Cauchy distributed and extreme value distributed fuzzy random variables is developed in this paper. The proposed...
详细信息
A new technique for solving fuzzy multiobjective chance constrained programming problems associated with Cauchy distributed and extreme value distributed fuzzy random variables is developed in this paper. The proposed methodology includes both fuzziness and randomness under one roof. At first fuzzy programming model is constructed from the fuzzy probabilistic model applying chance constrained programming methodology and alpha-cuts. Then using the method of defuzzification with probability density function of the corresponding membership functions the fuzzy model is converted into the deterministic one. Afterward by setting the imprecise aspiration level for each of the individual objectives, the membership functions are defined to measure the degree of achievements of the goal levels of the objectives. Finally, a weighted fuzzy goal programming technique is applied to achieve the highest degree of each of the defined membership goals to the extent possible by minimizing under deviational variables in the decision making context. To illustrate the proposed approach, a practical application is considered and solved and then the achieved solution is compared with the other existing technique.
We consider some types of generalized convexity and discuss new global semiparametric sufficient efficiency conditions for a multiobjective fractional programming problem involving n-set functions.
We consider some types of generalized convexity and discuss new global semiparametric sufficient efficiency conditions for a multiobjective fractional programming problem involving n-set functions.
This paper presents a fuzzy goal programming procedure to solve multiobjective quadratic bilevel programming problems, where all the parameters involved in objectives of each level decision maker and in system constra...
详细信息
ISBN:
(纸本)9781467357869
This paper presents a fuzzy goal programming procedure to solve multiobjective quadratic bilevel programming problems, where all the parameters involved in objectives of each level decision maker and in system constraints are fuzzily defined. In model formulation process the fuzzy numbers associated with the parameters are described by using the concept of α-cut of fuzzy numbers. Then the model is decomposed on the basis of the tolerance limits of fuzzy numbers. Individual decision at each objective at each level is found in isolation to find the fuzzy goals of the objectives. Then a fuzzy goal programming model is developed to minimize the group regret of degree of satisfactions of both the decision makers and to achieve the highest degree (unity) of each of the membership goals for overall benefit of the organization. In the decision process Taylor's series linear approximation technique is applied to make the quadratic membership goals to its equivalent linear form. To establish the efficiency of the proposed approach a numerical example is solved.
In this paper, we consider a nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints (MOSIMPECs). We introduce the concept of Mordukhovich stationary point for the nonsmoo...
详细信息
In this paper, we consider a nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints (MOSIMPECs). We introduce the concept of Mordukhovich stationary point for the nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints in terms of the Clarke subdifferentials. Further, we establish that the M-stationary conditions introduced in this paper are strong KKT type sufficient optimality conditions for the nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints under generalized invexity assumptions. We also illustrate our result with an example. (C) 2016 Published by Elsevier B.V.
In this paper, we focus on multiobjective integer programming problems involving random variable coefficients in objective functions and constraints. Using the concept of chance constrained conditions, such multiobjec...
详细信息
In this paper, we focus on multiobjective integer programming problems involving random variable coefficients in objective functions and constraints. Using the concept of chance constrained conditions, such multiobjective stochastic integer programming problems are transformed into deterministic ones based on the fractile criterion optimization model. As a fusion of stochastic programming and fuzzy one, we introduce fuzzy goals representing the ambiguity of the decision maker's judgments into them and define M-theta-efficiency, a new concept of efficient solution, as a fusion of stochastic approaches and fuzzy ones. Then, we construct an interactive fuzzy satisficing method using genetic algorithms to derive a satisficing solution for the decision maker which is guaranteed to be M-theta-efficient by updating the reference membership levels. Finally, the efficiency of the proposed method is demonstrated through numerical experiments. (C) 2010 Elsevier Ltd. All rights reserved.
Solution procedure consisting of fuzzy goal programming and stochastic simulation-based genetic algorithm is presented, in this article, to solve multiobjective chance constrained programming problems with continuous ...
详细信息
Solution procedure consisting of fuzzy goal programming and stochastic simulation-based genetic algorithm is presented, in this article, to solve multiobjective chance constrained programming problems with continuous random variables in the objective functions and in chance constraints. The fuzzy goal programming formulation of the problem is developed first using the stochastic simulation-based genetic algorithm. Without deriving the deterministic equivalent, chance constraints are used within the genetic process and their feasibilities are checked by the stochastic simulation technique. The problem is then reduced to an ordinary chance constrained programming problem. Again using the stochastic simulation-based genetic algorithm, the highest membership value of each of the membership goal is achieved and thereby the most satisfactory solution is obtained. The proposed procedure is illustrated by a numerical example.
In this paper, we focus on necessary and sufficient efficiency conditions for optimization problems with multiple objectives and a feasible set defined by interval-valued functions. A new concept of Fritz-John and Kar...
详细信息
In this paper, we focus on necessary and sufficient efficiency conditions for optimization problems with multiple objectives and a feasible set defined by interval-valued functions. A new concept of Fritz-John and Karush-Kuhn-Tucker-type points is introduced for this mathematical programming problem based on the gH-derivative concept. The innovation and importance of these concepts are presented from a practical and computational point of view. The problem is approached directly, without transforming it into a real-valued programming problem, thereby attaining theoretical results that are more powerful and computationally more efficient under weaker hypotheses. We also provide necessary conditions for efficiency, which have been inexistent in the relevant literature to date. The identification of necessary conditions is important for the development of future computational optimization techniques in an interval-valued environment. We introduce new generalized convexity notions for gH-differentiable interval-valued problems which are a generalization of previous concepts and we prove a sufficient efficiency condition based on these concepts. Finally, the efficiency conditions for deterministic programming problems are shown to be particular instances of the results proved in this paper. The theoretical developments are illustrated and justified through several numerical examples. (C) 2017 Elsevier Inc. All rights reserved.
暂无评论