• 품질경영학회지
• /
• 제20권1호
• /
• pp.101-106
• /
• 1992

In this paper fuzzy goal programming problems with fuzzy constraints and fuzzy coefficients in both matrix and right hand side of the constraints set are considered. Because of fuzzy coefficients in both members of each constraint ranking methods for fuzzy numbers are considered. An additive model to solve fuzzy goal programming problems is formulated. The diversity of each methods provides a lot of different models of auxiliary linear programming problems from which fuzzy solutions to the fuzzy goal programming problem can be obtained.

• 조명전기설비학회논문지
• /
• 제18권1호
• /
• pp.146-153
• /
• 2004

본 연구에서는 Fuzzy Goal Programming을 이용하여 배전계통에서 분산형 전원의 설치 및 운영에 대한 새로운 방안을 제시하였다. 분산형전원의 설치 및 운영을 위하여 최적화 알고리즘의 탐색공간의 크기를 줄이면서 계통상황 변동에 적합하게 정식화하였다. 특히, 목적함수인 계통 유효전력손실과 제약조건인 분산형전원의 수 또는 총용량 및 모선전압에 대하여 각각의 부정확한 성질을 평가하기 위하여 퍼지 Goal Programing으로 모델링 하였으며, 유전알고리즘을 사용하여 최적해를 탐색하였다.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.449-460
• /
• 2007

Several fuzzy approaches can be considered for solving multi-objective 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.

• Journal of the Korean Data and Information Science Society
• /
• 제15권2호
• /
• pp.457-465
• /
• 2004

Ramik[7] introduced a fuzzy goal programming (FGP)problem that generalizes a standard goal programming (GP) problem with fuzzy alternatives, fuzzy objective functions and fuzzy deviation functions for measuring the deviation between attained and desired goals being fuzzy. However, it is known that this FGP tends to produce an approximate solution since it uses an approximate fuzzy multiplication operation to solve the resultant fuzzy model. In this paper, we show that this FGP sometimes leads to the wrong decision. We also propose a procedure that gets the exact solution to overcome these problems. The method is based on $T_M$ (min norm)-based fuzzy operations using $\alpha-cut$ representations. We consider the same example as used in Ramik and investigate how our procedures are compared to Ramik's.

• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.599-607
• /
• 2006

We propose a simple new analytic method for solving a fuzzy goal programming (FGP) problem with general membership functions of fuzzy goals and re-examine a previously defined method for dealing with fuzzy weights for each of the goals. Several illustrative examples are given.

• 산업경영시스템학회지
• /
• 제18권34호
• /
• pp.185-191
• /
• 1995

In this research, a mathematical programming model is developed for the economic modeling of sampling plans based on two evaluation criteria : the outgoing quality and the average total inspection cost A fuzzy goal programming model and its solution procedure are proposed for the managers whose management objectives on the two evaluation criteria are not rigorous. To study the sensitivity of quality characteristic dependence on the resulting inspection plans, a numerical example is solved several times for a dependent model.

• Management Science and Financial Engineering
• /
• 제13권2호
• /
• pp.1-27
• /
• 2007

This paper presents a fuzzy-goal programming(FGP) approach for Bi-Level Linear Multiple Objective Decision Making(BLL-MODM) problem in a large hierarchical decision making and planning organization. The proposed approach combines the attractive features of both fuzzy set theory and goal programming(GP) for MODM problem. The GP problem has been developed by fixing the weights and aspiration levels for generating pareto-optimal(satisfactory) solution at each level for BLL-MODM problem. The higher level decision maker(HLDM) provides the preferred values of decision vector under his control and bounds of his objective function to direct the lower level decision maker(LLDM) to search for his solution in the right direction. Illustrative numerical example is provided to demonstrate the proposed approach.

• 한국경영과학회지
• /
• 제11권1호
• /
• pp.36-43
• /
• 1986

In this study, the fuzzy programming is extended to handle various types of membership functions by transformation of the complicated fuzzy programming problems into the equivalent crisp linear programming problems with single objective. It is well-known that the fuzzy programming problem with linear membership functions (i.e., ramp type) can be easily transformed into a linear programming problem by introducing one dummy variable to minimize the worst unwanted deviation. However, until recently not many researches have been done to handle various general types of complicated linear membership functions which might be more realistic than ramp-or triangular-type functions. In order to handle these complicated membership functions, the goal dividing concept, which is based on the fuzzy set operation (i. e., intersection and union operations), has been prepared. The linear model obtained using the goal dividing concept is more efficient and single than the previous models [4, 8]. In addition, this result can be easily applied to any nonlinear membership functions by piecewise approximation since the membership function is continuous and monotone increasing or decreasing.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.512-516
• /
• 1998

Fuzzy mathematical programming (FMP) can be treated an uncertainty condition using fuzzy concept. Further, it can be extended to the multiple objective (or goal) programming problem, naturally. But we feel that FMP have some shortcomings such as the fuzzy number in FMP is the one dimesional possibility set, so it can not be represented the relationship between them, and, in spite of FMP includes some (uncertainty) fuzzy paramenters, many alogrithms are only obtained a crisp solution.In this study, we propose a method of FMS. Our method use the scenario approach (or fuzzy random variables) to represent the relationship between fuzzy numbers, and can obtain the fuzzy solution.

• 한국항해학회지
• /
• 제20권4호
• /
• pp.59-70
• /
• 1996

A berth assignment problem has a direct impact on assessment of charges made to ships and goods. In this paper, we concerned with of fuzzy mathematical programming models for a berth assignment problem to achieved an efficient berth operation in a fuzzy environment. In this paper, we focus on the berth assignment programming with fuzzy parameters which are based on personal opinions or subjective judgement. From the above point of view, assume that a goal and a constraint are given by fuzzy sets, respectively, which are characterized by membership functions. Let a fuzzy decision be defined as the fuzzy set resulting from the intersection of a goal and constraint. This paper deals with fuzziness in all parameters which are expressed by fuzzy numbers. A fuzzy parameter defined by a fuzzy number means a possibility distribution of the parameters. These fuzzy 0-1 integer programming problems are formulated by fuzzy functions whose concept is also called the extension principle. We deal with a berth assignment problem with triangular fuzzy coefficients and propose a branch and bound algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) concept. The berth assignment problem is formulated by min-max and fuzzy 0-1 integer programming. Finally, we gave the numerical solutions of the illustrative examples.