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.     

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.     

Stackelberg solutions for fuzzy random two-level linear programming through probability maximization with possibility

This paper considers Stackelberg solutions for decision making problems in hierarchical organizations under fuzzy random environments. Taking into account vagueness of judgments of decision makers, fuzzy goals are introduced into the formulated fuzzy random two-level linear programming problems. On the basis of the possibility and necessity measures that each objective function fulfills the corresponding fuzzy goal, together with the introduction of probability maximization criterion in stochastic programming, we propose new two-level fuzzy random decision making models which maximize the probabilities that the degrees of possibility and necessity are greater than or equal to certain values. Through the proposed models, it is shown that the original two-level linear programming problems with fuzzy random variables can be transformed into deterministic two-level linear fractional programming problems. For the transformed problems, extended concepts of Stackelberg solutions are defined and computational methods are also presented. A numerical example is provided to illustrate the proposed methods.     

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.     

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.     

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.     

Fractional programming approach to fuzzy weighted average

This paper proposes a fractional programming approach to construct the membership function for fuzzy weighted average. Based on the -cut representation of fuzzy sets and the extension principle, a pair of fractional programs is formulated to find the -cut of fuzzy weighted average. Owing to the special structure of the fractional programs, in most cases, the optimal solution can be found analytically. Consequently, the exact form of the membership function can be derived by taking the inverse function of the -cut. For other cases, a discrete but exact solution to fuzzy weighted average is provided via an efficient solution method. Examples are given for illustration.     

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.     

An interactive fuzzy goal programming approach for multi-period multi-product production planning problem

This study addresses an interactive multiple fuzzy goal programming (FGP) approach to the multi-period multi-product (MPMP) production planning problem in an imprecise environment. The proposed model attempts to simultaneously minimize total production costs, rates of changes in labor levels, and maximizing machine utilization, while considering individual production routes of parts, inventory levels, labor levels, machine capacity, warehouse space, and the time value of money. Piecewise linear membership functions are utilized to represent decision maker’s (DM’s) overall satisfaction levels. A numerical example demonstrates the feasibility of applying the proposed model to the MPMP problem. Furthermore, the proposed interactive approach facilitates the DM with a systematic framework of decision making process which enables DM to modify the search direction to reach the most satisfactory results during solving process.     

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.     

A note on article “A tolerance approach to the fuzzy goal programming problems with unbalanced triangular membership function”

Kim and Whang use a tolerance approach for solving fuzzy goal programming problems with unbalanced membership functions [J.S. Kim, K. Whang, A tolerance approach to the fuzzy goal programming problems with unbalanced triangular membership function, European Journal of Operational Research 107 (1998) 614–624]. In this note it is shown that some results in that article are incorrect. The necessary corrections are proposed.     

An interactive fuzzy satisficing method for structured multiobjective linear fractional programs with fuzzy numbers

In this paper, by considering the experts' vague or fuzzy understanding of the nature of the parameters in the problem formulation process, multiobjective linear fractional programming problems with block angular structure involving fuzzy numbers are formulated. Using the a-level sets of fuzzy numbers, the corresponding nonfuzzy a-multiobjective linear fractional programming problem is introduced. The fuzzy goals of the decision maker for the objective functions are quantified by eliciting the corresponding membership functions including nonlinear ones. Through the introduction of extended Pareto optimality concepts, if the decision maker specifies the degree a and the reference membership values, the corresponding extended Pareto optimal solution can be obtained by solving the minimax problems for which the Dantzig-Wolfe decomposition method and Ritter's partitioning procedure are applicable. Then a linear programming-based interactive fuzzy satisficing method with decomposition procedures for deriving a satisficing solution for the decision maker efficiently from an extended Pareto optimal solution set is presented. An illustrative numerical example is provided to demonstrate the feasibility of the proposed method.     

An intuitionistic fuzzy programming method for group decision making with interval-valued fuzzy preference relations

The paper develops a new intuitionistic fuzzy (IF) programming method to solve group decision making (GDM) problems with interval-valued fuzzy preference relations (IVFPRs). An IF programming problem is formulated to derive the priority weights of alternatives in the context of additive consistent IVFPR. In this problem, the additive consistent conditions are viewed as the IF constraints. Considering decision makers’ (DMs’) risk attitudes, three approaches, including the optimistic, pessimistic and neutral approaches, are proposed to solve the constructed IF programming problem. Subsequently, a new consensus index is defined to measure the similarity between DMs according to their individual IVFPRs. Thereby, DMs’ weights are objectively determined using the consensus index. Combining DMs’ weights with the IF program, a corresponding IF programming method is proposed for GDM with IVFPRs. An example of E-Commerce platform selection is analyzed to illustrate the feasibility and effectiveness of the proposed method. Finally, the IF programming method is further extended to the multiplicative consistent IVFPR.     

Fuzzy multi-choice goal programming

Goal programming as a well known technique has been widely used for solving multi objective decision making problems. However, in some practical cases, there may exist situations where the decision maker is interested in setting multi aspiration levels for objectives that may not be expressed in a precise manner. In this paper, a novel formulation of fuzzy multi-choice goal programming (FMCGP) is presented. The proposed approach not only improves the applicability of goal programming in real world situations but also provides useful insight about the solution of a new class of problems. To illustrate and clarify the proposed approach, a numerical example is presented.     

Binary fuzzy goal programming approach to single model straight and U-shaped assembly line balancing

Assembly line balancing generally requires a set of acceptable solutions to the several conflicting objectives. In this study, a binary fuzzy goal programming approach is applied to assembly line balancing. Models for balancing straight and U-shaped assembly lines with fuzzy goals (the number of workstations and cycle time goals) are proposed. The binary fuzzy goal programming models are solved using the methodology introduced by Chang [Chang, C.T., 2007. Binary fuzzy goal programming. European Journal of Operational Research 180 (1), 29–37]. An illustrative example is presented to demonstrate the validity of the proposed models and to compare the performance of straight and U-shaped line configurations.     

Fuzzy analytic hierarchy process: A logarithmic fuzzy preference programming methodology

Fuzzy analytic hierarchy process (AHP) proves to be a very useful methodology for multiple criteria decision-making in fuzzy environments, which has found substantial applications in recent years. The vast majority of the applications use a crisp point estimate method such as the extent analysis or the fuzzy preference programming (FPP) based nonlinear method for fuzzy AHP priority derivation. The extent analysis has been revealed to be invalid and the weights derived by this method do not represent the relative importance of decision criteria or alternatives. The FPP-based nonlinear priority method also turns out to be subject to significant drawbacks, one of which is that it may produce multiple, even conflict priority vectors for a fuzzy pairwise comparison matrix, leading to entirely different conclusions. To address these drawbacks and provide a valid yet practical priority method for fuzzy AHP, this paper proposes a logarithmic fuzzy preference programming (LFPP) based methodology for fuzzy AHP priority derivation, which formulates the priorities of a fuzzy pairwise comparison matrix as a logarithmic nonlinear programming and derives crisp priorities from fuzzy pairwise comparison matrices. Numerical examples are tested to show the advantages of the proposed methodology and its potential applications in fuzzy AHP decision-making.     

Fuzzy goal programming for multiobjective transportation problems

Several fuzzy approaches can be considered for solving multiobjective transportation problem. This paper presents a fuzzy goal programming approach to determine an optimal compromise solution for the multiobjective transportation problem. We assume that each objective function has a fuzzy goal. Also we assign a special type of nonlinear (hyperbolic) membership function to each objective function to describe each fuzzy goal. The approach focuses on minimizing the negative deviation variables from 1 to obtain a compromise solution of the multiobjective transportation problem. We show that the proposed method and the fuzzy programming method are equivalent. In addition, the proposed approach can be applied to solve other multiobjective mathematical programming problems. A numerical example is given to illustrate the efficiency of the proposed approach.     

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.     

Possibility linear programming with trapezoidal fuzzy numbers

Fuzzy linear programming with trapezoidal fuzzy numbers (TrFNs) is considered and a new method is developed to solve it. In this method, TrFNs are used to capture imprecise or uncertain information for the imprecise objective coefficients and/or the imprecise technological coefficients and/or available resources. The auxiliary multi-objective programming is constructed to solve the corresponding possibility linear programming with TrFNs. The auxiliary multi-objective programming involves four objectives: minimizing the left spread, maximizing the right spread, maximizing the left endpoint of the mode and maximizing the middle point of the mode. Three approaches are proposed to solve the constructed auxiliary multi-objective programming, including optimistic approach, pessimistic approach and linear sum approach based on membership function. An investment example and a transportation problem are presented to demonstrate the implementation process of this method. The comparison analysis shows that the fuzzy linear programming with TrFNs developed in this paper generalizes the possibility linear programming with triangular fuzzy numbers.     

The supplier selection problem of a manufacturing company using the weighted multi-choice goal programming and MINMAX multi-choice goal programming

This paper presents two methods of decision making, Weighted multi-choice goal programming (MCGP) and MINMAX MCGP. With the proposed Weighted MCGP method, decision makers can set different weights w_i for each goal with linguistic terms, such as high, average and low, which can be transformed into trapezoidal fuzzy numbers. Meanwhile, with the proposed MINMAX MCGP method, this study also let decision makers set the satisfaction membership function for each goal according to their preference in order to eliminate the effect of different scales in each goal.This paper also investigates the relationship between Weighted multi-choice goal programming and MINMAX multi-choice goal programming. According to the sensitivity analysis, decision makers can get the solution with the minimum aggregate deviation for all multiple goals from the Weighted multi-choice goal programming. Meanwhile, decision makers can get the solution with the most balanced solution between all multiple goals from the MINMAX multi-choice goal programming method. The weight variable is introduced to the above two methods to provide decision-makers with a mechanism to evaluate the discrepancy between the maximum aggregate achievement and the most balanced solution, enabling decision-makers to reach the preferable decision for their situation. A real-world problem of supplier selection by the purchasing and sales managers of a manufacturing company is used to illustrate the differing solutions given by the two models.