• Korean Management Science Review
• /
• v.16 no.1
• /
• pp.63-74
• /
• 1999

This paper presents a R&D investment model for the Information and telecommunications(l&T) technology using multiple objective linear programming(MOLP). The MOLP model involves the simultaneous maximization of three linear objective functions associated with three criteria, which are social, technological, and economic criterion. This model is different from the traditional one which only involves the maximization of economic criterion. It yields a suitable R&D investment ratio to each technology field. Its application to the National R&D Project in l&t Industry is also presented. In this application, the Analytic Hierarchy Process(AHP) is proposed to estimate the weights, which used as the coefficients in each objective function of the MOLP model. Then the problem is solved using the interactive method STEM. It is showed that with the aid of STEM, the MOLP model can be useful decision aid in formulation R&D investment plan in l&t industry. It is expected that the MOLP model works as the basis for planning R&D investment strategy in l&T industry.

• Journal of Technology Innovation
• /
• v.7 no.2
• /
• pp.21-36
• /
• 1999

This paper presents a R&D investment model for Information and telecommunications (I&T) technology, which can be used by group decision makers, using multiple objective linear programming (MOLP). The MOLP model involves the simultaneous maximization of three linear objective functions associated with three criteria, which are social, technological, and economic criterion. This model is different from the traditional one which only involves the maximization of economic criterion. The presented problem in this model can be formulated as a problem of optimizing a linear function over an efficient set of MOLP. Its application to the National R&D Project in I&T Industry is also presented. In this application, the Analytic Hierarchy Process (AHP) is proposed to estimate the weights, which are used as the coefficients in each objective function of the MOLP model and in a linear decision function. By solving this problem, it yields a suitable R&D investment ratio to each technology field. It is showed that the MOLP model can be useful decision aid in formulating R&D investment plan in I&T industry which needs to be decided by group decision makers, not by an individual. It is expected that the MOLP model works as the basis for planning R&D investment strategy in I&T industry.

• Korean Management Science Review
• /
• v.10 no.2
• /
• pp.11-26
• /
• 1993

This paper presents a new interactive procedure for multiple objective linear programming problem (MOLP). In practical multiple objective linear programming applications, there is usually no need for the decision maker to consider solutions which are not efficient. Therefore, the interactive procedure presented here searches only among efficient solutions and terminates with a solution that is guaranteed to be efficient. It also can converge to nonextreme efficient final solutions rather than being restricted to only extreme efficient points of the feasible set. The procedure does not require sophisticated judgements or inputs from the decision maker. One of the most attractive features of the procedure however, is that the method allows the DM to examine the efficient faces it finds. As iteration goes, the DM can explore a wide variety of efficient faces rather than efficient faces confined to only certain subregion of the feasible set of problem MOLP since the efficient faces that the procedure finds need not be adjacent. This helps the DM explore the nature of the efficient set of problem MOLP and also helps the DM have confidence with a final solution. For these reasons, I feel that the procedure offer significant promise in solving multiple objective linear programs rapidly and in a satisfying manner to the DM.

• Journal of the military operations research society of Korea
• /
• v.14 no.1
• /
• pp.33-41
• /
• 1988

In Multiple Objective Linear Programming (MOLP), it is well known that efficient solution and weight are correspondent to each other. The purpose of this paper is to study relationships between efficient face and the region of weight in MOLP. It is shown that the regions of weights corresponding to two efficient extreme points are also neighbor if two efficient extreme points are neighbor each other, and that the set of the efficient solutions corresponding to the common part of weight regions is efficient face. Using the above, we present a method to find the efficient solutions corresponding to a given weight and vice versa.

• Journal of the military operations research society of Korea
• /
• v.13 no.2
• /
• pp.33-41
• /
• 1987

In Multiple Objective Linear Programming (MOLP), it is well known that efficient solution and weight are correspondent to each other. The purpose of this paper is to study relationships between efficient face and the region of weight in MOLP. It is shown that the regions of weights corresponding to two efficient extreme points are also neighbor if two efficient extreme points are neighbor each other, and that the set of the efficient solutions corresponding to the common part of weight regions is efficient face. Using the above, we present a method to find the efficient solutions corresponding to a given weight and vice versa.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.299-319
• /
• 1997

Since a convergence strategy in interactive procedure is the origin of a lot of the restrictions and inconvenience of many methods, a new flexible convergence strategy is necessary for developing that is applicable for interactive MOLP as well as interactive multiple objective integer programming(MOIP). A method for computing the volume of the interval defined subsets of weighting vector space is developed using Sobol's LP$_{i}$, Generator. Since the interactive procedure requires a number of iterations, with a fixed number of solutions presented per iteration, a convergence strategy is needed to control the rate at which the interactive procedure converges to a final solution. Thus, in this paper, a new convergency strategy is developed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.53-56
• /
• 2000

The problem ( Ρ ) of optimizing a linear function d$\^$T/x over the set of efficient set for a multiple objective linear program ( Μ ) is difficult because the efficient set is nonconvex. There some interesting properties between the objective linear vector ｄ and the matrix of multiple objectives C and those properties lead us to establish criteria to solve ( Ρ ) with a linear program. In this paper we investigate a system of the linear equations C$\^$T/${\alpha}$=d and construct two linearly independent positive vectors ${\mu}$, ν such that ${\alpha}$=${\mu}$-ν. From those vectors ${\mu}$, ν, solving an weighted sum linear program for finding an efficient extreme point for the ( Μ ) is a way to get an optimal solution ( Ρ ). Therefore our theory gives an easy way of solving nonconvex program ( Ρ ) with a weighted sum linear program.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.119-128
• /
• 1994

There are three important regions im Multiple Objective Linear Programming (MOLP). One is the region of efficient solutions, another is the region of weight to be used for finding efficient solutions, the third is the region of efficient (nondominated) objective values. In this paper, first, we find the condition of extreme point in the region of efficient objective values. Second, we find that the sum of the dimension of the weight region and the dimension of efficient objective values region is constant. Using the above, it is shown that we find the shape and dimension of weight region corresponding to the given region or efficient objective values and vice versa.

• Industrial Engineering and Management Systems
• /
• v.11 no.1
• /
• pp.1-10
• /
• 2012

Supplier selection is an essential task within the purchasing function of supply chain management because it provides companies with opportunities to reduce various costs and realize stable and reliable production. However, many companies find it difficult to determine which suppliers should be targeted as each of them has varying strengths and weaknesses in performance which require careful screening by the purchaser. Moreover, information required to assess suppliers is not known precisely and typically fuzzy in nature. In this paper, therefore, fuzzy multi-objective linear programming (fuzzy MOLP) is presented under fuzzy goals: cost minimization, service level maximization and purchasing risk. To solve the problem, we introduce an enhanced two-phase approach of fuzzy linear programming for the supplier selection. In formulated problem, Analytical Hierarchy Process (AHP) is used to determine the weights of criteria, and Taguchi Loss Function is employed to quantify purchasing risk. Finally, we provide a set of alternative solution which enables decision maker (DM) to select the best compromise solution based on his/her preference. Numerical experiment is provided to demonstrate our approach.

• Journal of Korean Society of Forest Science
• /
• v.89 no.3
• /
• pp.335-341
• /
• 2000

In this study, the multiobjective linear programming (MOLP) formulation was built to solve for the optimal forest management planning considering carbon sequestration and timber production simultaneously. The formulation was applied to a case study problem to investigate the trends of the optimal forest harvest schedules as the function of preference of forest management for carbon sequestration and timber production. The study site was Mt. Kari area in Hongchun. The formulation includes several site-specific constraints for non-declining yields, upper and lower bounds of cut volume and area for timber, ending inventory conditions, etc.. According to the changes of weight combinations for timber production and carbon sequestration, the joint production possibilities curve was proposed as the option for management choice.