A method for solving fuzzy goal programming problems based on MINMAX approach

Narasimhan incorporated fuzzy set theory within goal programming formulation in 1980. Since then numerous research has been carried out in this field. One of the well-known models for solving fuzzy goal programming problems was proposed by Hannan in 1981. In this paper the conventional MINMAX approach in goal programming is applied to solve fuzzy goal programming problems. It is proved that the proposed model is an extension to Hannan model that deals with unbalanced triangular linear membership functions. In addition, it is shown that the new model is equivalent to a model proposed in 1991 by Yang et al. Moreover, a weighted model of the new approach is introduced and is compared with Kim and Whang’s model presented in 1998. A numerical example is given to demonstrate the validity and strengths of the new models.     

Fuzzy goal programming approach to multilevel programming problems

The purpose of this paper is to propose a procedure for solving multilevel programming problems in a large hierarchical decentralized organization through linear fuzzy goal programming approach. Here, the tolerance membership functions for the fuzzily described objectives of all levels as well as the control vectors of the higher level decision makers are defined by determining individual optimal solution of each of the level decision makers. Since the objectives are potentially conflicting in nature, a possible relaxation of the higher level decision is considered for avoiding decision deadlock. Then fuzzy goal programming approach is used for achieving highest degree of each of the membership goals by minimizing negative deviational variables. Sensitivity analysis with variation of tolerance values on decision vectors is performed to present how the solution is sensitive to the change of tolerance values. The efficiency of our concept is ascertained by comparing results with other fuzzy programming approaches.     

Solving multi-level multi-objective linear programming problems through fuzzy goal programming approach

In this paper, two new algorithms are presented to solve multi-level multi-objective linear programming (ML-MOLP) problems through the fuzzy goal programming (FGP) approach. The membership functions for the defined fuzzy goals of all objective functions at all levels are developed in the model formulation of the problem; so also are the membership functions for vectors of fuzzy goals of the decision variables, controlled by decision makers at the top levels. Then the fuzzy goal programming approach is used to achieve the highest degree of each of the membership goals by minimizing their deviational variables and thereby obtain the most satisfactory solution for all decision makers.     

Binary fuzzy goal programming

Goal programming is an important technique for solving many decision/management problems. Fuzzy goal programming involves applying the fuzzy set theory to goal programming, thus allowing the model to take into account the vague aspirations of a decision-maker. Using preference-based membership functions, we can define the fuzzy problem through natural language terms or vague phenomena. In fact, decision-making involves the achievement of fuzzy goals, some of them are met and some not because these goals are subject to the function of environment/resource constraints. Thus, binary fuzzy goal programming is employed where the problem cannot be solved by conventional goal programming approaches. This paper proposes a new idea of how to program the binary fuzzy goal programming model. The binary fuzzy goal programming model can then be solved using the integer programming method. Finally, an illustrative example is included to demonstrate the correctness and usefulness of the proposed model.     

A tolerance approach to the fuzzy goal programming problems with unbalanced triangular membership function

This paper investigates the application of tolerance concepts to goal programming in a fuzzy environment. Firstly, the paper presents how the fuzzy goal programming (FGP) problems with unequal weights can be formulated as a single linear programming problem with the concept of tolerances. Next, it illustrates a numerical example to demonstrate how convenient the present model is to solve a FGP problem with unequal weights and unbalanced linear membership functions     

Enhanced interactive satisficing method via alternative tolerance for fuzzy goal programming with progressive preference

This paper proposes an enhanced interactive satisficing method via alternative tolerance for fuzzy goal programming with progressive preference. The alternative tolerances of the fuzzy objectives with three types of fuzzy relations are used to model progressive preference of decision maker. In order to improve the dissatisficing objectives, the relaxed satisficing objectives are sacrificed by modifying their tolerant limits. By means of attainable reference point, the auxiliary programming is designed to generate the tolerances of the dissatisficing objectives for ensuring feasibility. Correspondingly, the membership functions are updated or the objective constraints are added. The Max–Min goal programming model (or the revised one) and the test model of the M-Pareto optimality are solved lexicographically. By our method, the dissatisficing objectives are improved iteratively till the preferred result is acquired. Illustrative examples show its power.     

Fuzzy goal programming with nested priorities

This paper proposes a new approach to formulating fuzzy priorities in a goal programming problem. The proposed methodology remedies certain shortcomings of the composite membership function approach discussed in previous works [7, 10]. The principal advantage of the proposed method is that it leads to a formulation in which tradeoffs between goals more closely reflect the decision maker's intentions than in other noninteractive approaches [8, 9, 10, 14], in some of which a fixed hierarchy of goals is assumed.     

Fractional Goal Programming for Fuzzy Solid Transportation Problem with Interval Cost

In this paper, we study a solid transportation problem with interval cost using fractional goal programming approach (FGP). In real life applications of the FGP problem with multiple objectives, it is difficult for the decision-maker(s) to determine the goal value of each objective precisely as the goal values are imprecise, vague, or uncertain. Therefore, a fuzzy goal programming model is developed for this purpose. The proposed model presents an application of fuzzy goal programming to the solid transportation problem. Also, we use a special type of non-linear (hyperbolic) membership functions to solve multi-objective transportation problem. It gives an optimal compromise solution. The proposed model is illustrated by using an example.     

Linear programming with fuzzy parameters: An interactive method resolution

This paper proposes a method for solving linear programming problems where all the coefficients are, in general, fuzzy numbers. We use a fuzzy ranking method to rank the fuzzy objective values and to deal with the inequality relation on constraints. It allows us to work with the concept of feasibility degree. The bigger the feasibility degree is, the worst the objective value will be. We offer the decision-maker (DM) the optimal solution for several different degrees of feasibility. With this information the DM is able to establish a fuzzy goal. We build a fuzzy subset in the decision space whose membership function represents the balance between feasibility degree of constraints and satisfaction degree of the goal. A reasonable solution is the one that has the biggest membership degree to this fuzzy subset. Finally, to illustrate our method, we solve a numerical example.     

Editorial

Linear programming problems with fuzzy parameters are formulated by fuzzy functions. The ambiguity considered here is not randomness, but fuzziness which is associated with the lack of a sharp transition from membership to nonmembership. Parameters on constraint and objective functions are given by fuzzy numbers. In this paper, our object is the formulation of a fuzzy linear programming problem to obtain a reasonable solution under consideration of the ambiguity of parameters. This fuzzy linear programming problem with fuzzy numbers can be regarded as a model of decision problems where human estimation is influential.     

Interactive fuzzy goal programming approach for bilevel programming problem

This paper presents an interactive fuzzy goal programming (FGP) approach for bilevel programming problems with the characteristics of dynamic programming (DP).     

Optimal stopping in a fuzzy environment

The problem under consideration is that of optimally controlling and stopping either a deterministic or a stochastic system in a fuzzy environment. The optimal decision is the sequence of controls that maximizes the membership function of the intersection of the fuzzy constraints and a fuzzy goal. The fuzzy goal is a fuzzy set in the cartesian product of the state space with the set of possible stopping times. Dynamic programming is applied to yield a numerical solution. This approach yields an algorithm that corrects a result of Kacprzyk.     

A fuzzy shortest path with the highest reliability

This paper concentrates on a shortest path problem on a network where arc lengths (costs) are not deterministic numbers, but imprecise ones. Here, costs of the shortest path problem are fuzzy intervals with increasing membership functions, whereas the membership function of the total cost of the shortest path is a fuzzy interval with a decreasing linear membership function. By the max–min criterion suggested in [R.E. Bellman, L.A. Zade, Decision-making in a fuzzy environment, Management Science 17B (1970) 141–164], the fuzzy shortest path problem can be treated as a mixed integer nonlinear programming problem. We show that this problem can be simplified into a bi-level programming problem that is very solvable. Here, we propose an efficient algorithm, based on the parametric shortest path problem for solving the bi-level programming problem. An illustrative example is given to demonstrate our proposed algorithm.     

A fuzzy goal programming method with imprecise goal hierarchy

Two most widely used approaches to treating goals of different importance in goal programming (GP) are: (1) weighted GP, where importance of goals is modelled using weights, and (2) preemptive priority GP, where a goal hierarchy is specified implying infinite trade-offs among goals placed in different levels of importance. These approaches may be too restrictive in modelling of real life decision making problems. In this paper, a novel fuzzy goal programming method is proposed, where the hierarchical levels of the goals are imprecisely defined. The imprecise importance relations among the goals are modelled using fuzzy relations. An additive achievement function is defined, which takes into consideration both achievement degrees of the goals and degrees of satisfaction of the fuzzy importance relations. Examples are given to illustrate the proposed method.     

Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights

This paper proposes a parametric programming approach to analyze the fuzzy maximum total return in the continuous knapsack problem with fuzzy objective weights, in that the membership function of the maximum total return is constructed. The idea is based on Zadeh’s extension principle, α-cut representation, and the duality theorem of linear programming. A pair of linear programs parameterized by possibility level α is formulated to calculate the lower and upper bounds of the fuzzy maximum total return at α, through which the membership function of the maximum total return is constructed. To demonstrate the validity of the proposed procedure, an example studied by the previous studies is investigated successfully. Since the fuzzy maximum total return is completely expressed by a membership function rather than by a crisp value reported in previous studies, the fuzziness of object weights is conserved completely, and more information is provided for making decisions in real-world resource allocation applications. The generalization of the proposed approach for other types of knapsack problems is also straightforward.     

Linear programming with multiple fuzzy goals

This paper describes the use of fuzzy set theory in goal programming (GP) problems. In particular, it is demonstrated how fuzzy or imprecise aspirations of the decision maker (DM) can be quantified through the use of piecewise linear and continuous functions. Models are then presented for the use of fuzzy goal programming with preemptive priorities, with Archimedean weights, and with the maximization of the membership function corresponding to the minimum goal. Examples are also provided.     

A note on chance constrained programming with fuzzy coefficients

This paper deals with nonlinear chance constrained programming as well as multiobjective case and goal programming with fuzzy coefficients occurring in not only constraints but also objectives. We also present a fuzzy simulation technique for handling fuzzy objective constraints and fuzzy goal constraints. Finally, a fuzzy simulation based genetic algorithm is employed to solve a numerical example.     

Comment to “interactive fuzzy goal programming approach for bilevel programming problem” by S.R. Arora and R. Gupta

The fuzzy bilevel programming problem is solved in the paper [1] using an approach of fuzzy goal programming. Using a simple example we show that this will not lead to a satisfactory solution. Especially the fuzzy constraint that the upper level variable is near some desired one has no influence on the computed solution in the example. This constraint is used to model the hierarchy in the approach in [1]. At the end of the paper we suggest one straightforward possibility for modeling the fuzzy bilevel programming problem and converting it into a crisp substitute.     

Bilevel programming approach applied to the flow shop scheduling problem under fuzziness

This paper presents a fuzzy bilevel programming approach to solve the flow shop scheduling problem. The problem considered here differs from the standard form in that operators are assigned to the machines and imposing a hierarchy of two decision makers with fuzzy processing times. The shop owner considered higher level and assigns the jobs to the machines in order to minimize the flow time while the customer is the lower level and decides on a job schedule in order to minimize the makespan. In this paper, we use the concepts of tolerance membership function at each level to define a fuzzy decision model for generating optimal (satisfactory) solution for bilevel flow shop scheduling problem. A solution algorithm for solving this problem is given. Mathematics Subject Classification: 90C70, 90B36, 90C99     

On fuzzy linear programming

Fuzzy multi-objective and fuzzy Goal Programming are discussed in connection with several membership functions which are used to transform the original problem into three equivalent linear programming problems. Existence and uniqueness theorems are given. Fuzzy duality is presented, and an extension of the initial fuzzy problem arises immediately from it.