• Title/Summary/Keyword: Multiobjective Linear Programming

Search Result 10, Processing Time 0.029 seconds

Efficiency Test in Possibilistic Multiobjective Linear Programming

  • Ida, Masaaki
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.506-511
    • /
    • 1998
  • In this paper we consider multiobjective linear programming problems with coefficients of the objective functions specified by possibility distributions. Possibly and necessarily efficient solution sets are defined as funny solution sets whose membership grades represent possibility and necessity degrees to which a feasible solution is efficient. Considering efficiency condition and its dual condition in ordinary multiobjective linear programming problem, we propose efficiency test methods based on an extreme ray generation method. Since the proposed methods can be put in the part of a bi-section method, we can develop calculation and methods of the degree of possible and necessary efficiency for feasible solutions.

  • PDF

Multiple-Use Management Planning of Forest Resources Using Fuzzy Multiobjective Linear Programming (퍼지 다목표(多目標) 선형계획법(線型計劃法)에 의한 산림자원(山林資源)의 다목적(多目的) 경영계획(經營計劃))

  • Woo, Jong-Choon
    • Journal of Korean Society of Forest Science
    • /
    • v.85 no.2
    • /
    • pp.172-179
    • /
    • 1996
  • This paper described the application of fuzzy multiobjective linear programming to solving a multiple-use problem of forest resources management. At first the concepts of linear programming, fuzzy linear programming and fuzzy multiobjective linear programming were introduced briefly. In order to illustrate a role of fuzzy multiobjective linear programming in the process of multiple-use forest planning, the natural recreation forest in Mt. Yoomyung was selected for this study. A fuzzy multiobjective linear programming model is formulated with data obtained from this Mt. Yoomyumg natural recreation forest to solve the multiple-use management planning problem of forest resources. Finally, the results, which were obtained from the calculation of this model, were discussed. The maximal value of the membership function(${\lambda}$) was 0.29, when the timber production and the forest recreation function were optimized at the same time through the fuzzy multiobjective linear programming. The cutting area in each period was 102.7ha, while total cutting area was 410.8ha for 4 periods. During 4 periods $57,904m^3$ will be harvested from this natural recreation forest and at the same time total visitors were estimated to be about 8.6 millions persons.

  • PDF

A New Approach for Forest Management Planning : Fuzzy Multiobjective Linear Programming (삼림경영계획(森林經營計劃)을 위한 새로운 접근법(接近法) : 퍼지 다목표선형계획법(多目標線型計劃法))

  • Woo, Jong Choon
    • Journal of Korean Society of Forest Science
    • /
    • v.83 no.3
    • /
    • pp.271-279
    • /
    • 1994
  • This paper descbibes a fuzzy multiobjective linear programming, which is a relatively new approach in forestry in solving forest management problems. At first, the fuzzy set theory is explained briefly and the fuzzy linear programming(FLP) and the fuzzy multiobjective linear programming(FMLP) are introduced conceptionally. With the information obtained from the study area in Thailand, a standard linear programming problem is formulated, and optimal solutions (present net worth) are calculated for four groups of timber price by this LP model, respectively. This LP model is reformulated to a fuzzy multiobjective linear programming model to accommodate uncertain timber values and with this FMLP model a compromise solution is attained. Optimal solutions of four objective functions for four timber price groups and the compromise solution are compared and discussed.

  • PDF

Constrained Integer Multiobjective Linear Fractional Programming Problem

  • Thirwani, Deepa;Arora, S.R.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.21 no.3
    • /
    • pp.227-236
    • /
    • 1996
  • In this paper an algorithm based on cutting plane approach is developed which constructs all the efficient p-tuples of multiobjective integer linear fractional programming problem. The integer solution is constrained to satisfy and h out of n additional constraint sets. A numerical illustration in support of the proposed algorithm is developed.

  • PDF

ON MULTIOBJECTIVE GENERALIZED SYMMETRIC DUAL PROGRAMS WITH $\rho-(\eta,0)$-INVEXITY

  • Nahak, C.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.797-804
    • /
    • 1998
  • A pair of multiobjective generalized symmetric dual non-linear programming problems and weak strong and converse dual-ity theorems for these problems are established under generalized $\rho-(\eta,0)$-invexity assumptions. Several known results are obtained as special cases.

Optimal Forest Management Planning for Carbon Sequestration and Timber Production Using Multiobjective Linear Programming (탄소저장(炭素貯藏) 및 목재생산효과(木材生産效果) 중심(中心)의 산림경영계획(山林經營計劃)을 위한 다목적(多目的) 선형계획법(線型計劃法)의 응용(應用))

  • Park, Eun Sik;Chung, Joo Sang
    • 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.

  • PDF

Multiobjective Vehicle Scheduling Problem with Time and Area-Dependent Travel Speeds: Scheduling Algorithm and Expert System (시간대 및 구역의존 차량이동속도를 고려하는 다목적차량일정문제: 일정계획해법과 전문가시스템)

  • Park, Yang-Byung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.4
    • /
    • pp.621-633
    • /
    • 1997
  • This paper is concerned with the multiobjective vehicle scheduling problem with time and area-dependent travel speeds(MVSPTD), in which two conflicting objectives are explicitly treated and the travel speed between two locations depends on the passing area and time of day. The two objectives are the minimization of total vehicle travel time and the minimization of total weighted tardiness. First, I construct a mixed integer linear programming formulation of the MVSPTD, and present o heuristic algorithm that builds the vehicle schedules based on the savings computed. The results of computational experiments showed that the heuristic performs very well. Finally, I propose an expert system for vehicle scheduling in the MVSPTD. Its whole process is executed under VP-Expert expert system environment.

  • PDF

Development of Clustering Algorithm for the Design of Telecommunication Network Considering Cost-Traffic Tradeoff (Cost-Traffic Tradeoff를 고려한 통신망 설계의 Clustering 알고리듬 개발)

  • 박영준;이홍철;김승권
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.23-36
    • /
    • 1997
  • In the design of telecommunication network, the network configuration using hubbing topology is useful for designing and managing the network efficiently : i. e. all of central offices (COs) are grouped into clusters. Each cluster has one hub consisting of large-scale transmission facilities like digital cross-connect systems and ATMs. In clustering process, the community of interest and geographical factor should be considered. However, there exists a tradeoff between two factors. One is to minimize total link costs for geographical factor and the other is to maximize the total intra-cluster traffics for community of interest. Hence, this can be solved by multiobjective linear programming techniques. In this paper, the problem under considerations is formulated as two p-median subproblems taking into considerations total costs and total intra-traffics, respectively. Then we propose the algorithm to solve the problem based on the concept of cost-traffic tradeoff. The algorithm enables to identify efficient cost-traffic tradeoff pairs. An illustration is also presented.

  • PDF

Optimal Reservoir Operation Using Goal Programming for Flood Season (Goal Programming을 이용한 홍수기 저수지 최적 운영)

  • Kim, Hye-Jin;Ahn, Jae-Hwang;Choi, Chang-Won;Yi, Jae-Eung
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.11 no.2
    • /
    • pp.147-156
    • /
    • 2011
  • The purpose of multipurpose reservoir operation in flood season is to reduce the peak flood at a control point by utilizing flood control storage or to minimize flood damage by controlling release and release time. Therefore, the most important thing in reservoir operation for flood season is to determine the optimal release and release time. In this study, goal programming is used for the optimal reservoir operation in flood season. The goal programming minimizes a sum of deviation from the target value using linear programming or nonlinear programming to obtain the optimal alternative for the problem with more than two objectives. To analyze the applicability of goal programming, the historical storm data are utilized. The goal programming is applied to the reservoir system operation as well as single reservoir operation. Chungju reservoir is selected for single reservoir operation and Andong and Imha reservoirs are selected for reservoir system operation. The result of goal programming is compared with that of HEC-5. As a result, it was found that goal programming could maintain the reservoir level within flood control level at the end of a flood season and also maintain flood discharge within a design flood at a control point for each time step. The goal programming operation is different from the real operation in the sense that all inflows are assumed to be given in advance. However, flood at a control point can be reduced by calculating the optimal release and optimal release time using suitable constraints and flood forecasting system.