• Title/Summary/Keyword: Mathematical Programming Model

Search Result 243, Processing Time 0.032 seconds

Applying Multi-objective Mathematical Programming Model for Business Planning of Eco-friendly Agrifood Processing Enterprise in Korea (친환경농식품 가공업체의 경영계획 수립을 위한 다목표 수리계획모형의 적용 방안)

  • Cho, Wan-Hyung
    • Korean Journal of Organic Agriculture
    • /
    • v.26 no.2
    • /
    • pp.181-202
    • /
    • 2018
  • Most of eco-friendly agrifood processing enterprises in Korean rural area are small and medium-sized business. For this reason, it's hard for eco-friendly agrifood processing enterprises to neither analyze business performance for efficient business management nor establish their own business plan for rational decision-making. Therefore it's necessary to design effective mathematical programming model and to make practical application which can support rational management decision-making ensuring the stable business activity of eco-friendly agrifood processing enterprises. Accordingly this paper focuses on the designing and its application of multi-objective mathematical programming model using goal programming to support rational decision-making of eco-friendly agrifood processing enterprise. Hansalimanseongmachum Food Inc. which runs soy bean processing business making tofu based on regional-based soybean farms around Anseong City will be the specific case to apply multi-objective mathematical programming model in practice. And it will suggest measures to support rational management decision-making of other eco-friendly agrifood processing enterprises.

Three Mathematical Programming thhniques for Solving Transshipment Problems:a Wilcoxon Test

  • Kwak, N.K.;Hemaida, Ramadan S.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.3
    • /
    • pp.169-186
    • /
    • 1994
  • This paper presents three mathematical programming approaches to solving transshipment problems with interval supply and demand requirements. A linear goal programming model was developed based on the data obtained from a nationwide retail firm. Three mathematical programming model results were compared and analyzed, and three separate hypotheses were examined by using the Wilcoxon signed-ranked test for the model applicability. The test results were analyzed and interpreted for decision making.

  • PDF

A Linear Programming Model for Production Planning of Photovoltaic Materials (태양광 발전 소재 생산계획을 위한 선형계획 모형)

  • Lee, Seon-Jong;Lee, Hyun Cheol;Kim, Jaehee
    • Korean Management Science Review
    • /
    • v.32 no.4
    • /
    • pp.19-28
    • /
    • 2015
  • This study presents a mathematical programming model to develop production planning in the manufacturing processes for photovoltaic silicon ingots and wafers. The model is formulated as a linear programming model that maximizes total growth margin, which is composed of production cost, inventory cost, shortage cost, and sales profit while considering the constraints associated with the production environments of photovoltaic materials. In order to demonstrate the utility of the model for production planning, we run operations for a planning horizon of a year for a case study. When the primary results of this mathematical programming are compared with the historical records, the model could have resulted in the considerable increase of the total growth margin by effectively reducing inventory cost if a decision maker had employed the model as a decision support system with perfect information for sales demand.

Utilization of a Mathematical Programming Data Structure for the Implementation of a Water Resources Planning System (수자원 운영계획 시스템의 구현을 위한 수리계획 모형 자료구조의 활용)

  • Kim, Jae-Hee;Kim, Sheung-Kown;Park, Young-Joon
    • IE interfaces
    • /
    • v.16 no.4
    • /
    • pp.485-495
    • /
    • 2003
  • This paper reports on the application of the integration of mathematical programming model and database in a decision support system (DSS) for the planning of the multi-reservoir operating system. The DSS is based on a multi-objective, mixed-integer goal programming (MIGP) model, which can generate efficient solutions via the weighted-sums method (WSM). The major concern of this study is seamless, efficient integration between the mathematical model and the database, because there are significant differences in structure and content between the data for a mathematical model and the data for a conventional database application. In order to load the external optimization results on the database, we developed a systematic way of naming variable/constraint so that a rapid identification of variables/constraints is possible. An efficient database structure for planning of the multi-reservoir operating system is presented by taking advantage of the naming convention of the variable/constraint.

Optimum Water Allocation System Model in Keumho River Basin with Mathematical Programming Techniques (수리계획을 이용한 금호강유역의 최적 물배분 시스템모델)

  • 안승섭;이증석
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.39 no.2
    • /
    • pp.74-85
    • /
    • 1997
  • This study aims at the development of a mathematical approach for the optimal water allocation in the river basin where available water is not in sufficient. Its optimal allocation model is determined from the comparison and analysis of mathematical programming techniques such as transportation programming and dynamic programming models at its optimal allocation models. The water allocation system used in this study is designed to be the optimal water allocation which can satisfy the water deficit in each district through inter-basin water transfer between Kumho river basin which is a tributary catchment of Nakdong river basin, and the adjacent Hyungsan river basin, Milyang river basin and Nakdong upstream river basin. A general rule of water allocation is obtained for each district in the basins as the result of analysis of the optimal water allocation in the water allocation system. Also a comparison of the developed models proves that there is no big difference between the models Therefore transportation programming model indicates most adequate to the complex water allocation system in terms of its characteristics It can be seen, however, that dynamic programming model shows water allocation effect which produces greater net benefit more or less.

  • PDF

Genetic Algorithm of the Planar Storage Location Assignment Problem (평면적 저장 위치 할당 문제에 대한 유전자 알고리즘)

  • Park, Chang-Kyu;Seo, Jun-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.2
    • /
    • pp.129-140
    • /
    • 2009
  • This paper introduces the planar storage location assignment problem (PSLAP) that no research has attempted to mathematically solve. The PSLAP can be defined as the assignment of the inbound and outbound objects to the storage yard with aim of minimizing the number of obstructive object moves. The storage yard allows only planar moves of objects. The PSLAP usually occurs in the assembly block stockyard operations at a shipyard. This paper formulates the PSLAP using a mathematical programming model, but which belongs to the NP-hard problems category. Thus this paper utilizes an efficient genetic algorithm (GA) to solve the PSLAP for real-sized instances. The performance of the proposed mathematical programming model and developed GA is verified by a number of numerical experiments.

On the Assembly Block Storage Location Assignment Problem (조립블록 저장위치 할당문제에 대한 재고찰)

  • Park, Chang-Kyu;Seo, Jun-Yong
    • IE interfaces
    • /
    • v.22 no.2
    • /
    • pp.116-125
    • /
    • 2009
  • We revisit the assembly block storage location assignment problem (ABSLAP) at a shipyard, in order to compensate for the deficiency in performance verification of the heuristic ABSLAP algorithm developed by the previous study. In this paper, we formulate a mathematical programming model of the ABSLAP, refine elaborately the heuristic ABSLAP algorithm, and show the performance of the developed mathematical programming model and the revised heuristic ABSLAP algorithm. In addition, we explain simulation experiments conducted using the revised heuristic ABSLAP algorithm to investigate the influences of block stockyard layouts and production schedule instability on the block stockyard operations.

Optimal Inspection Policy By Fuzzy Goal Programming (Fuzzy Goal Programming을 이용한 최적 검사 정책)

  • 유정상
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.18 no.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.

  • PDF

An Integer Programming Model for the Rolling Stock Assignment Plan (철도차량 할당계획을 위한 정수계획법모형)

  • 김성호;홍순흠
    • Proceedings of the KSR Conference
    • /
    • 2002.10a
    • /
    • pp.349-356
    • /
    • 2002
  • This paper describes a mathematical programming model for constructing the rolling stock assignment plan. This plan is a schedule which assigns daily routings, maintenance activities, and other tasks to trainsets. A generalized set partitioning model which is a kind of integer programming model is suggested as a model for constructing the assignment plan. And a column generation method are suggested as a solution method.

  • PDF

A robust nonlinear mathematical programming model for design of laterally loaded orthotropic steel plates

  • Maaly, H.;Mahmoud, F.F.;Ishac, I.I.
    • Structural Engineering and Mechanics
    • /
    • v.14 no.2
    • /
    • pp.223-236
    • /
    • 2002
  • The main objective of the present paper is to address a formal procedure for orthotropic steel plates design. The theme of the proposed approach is to recast the design procedure into a mathematical programming model. The objective function to be optimized is the total weight of the structure. The total weight is function of its layout parameters and structural element design variables. Mean while the proposed approach takes into consideration the strength and rigidity criteria in addition to other dimensional constraints. A nonlinear programming model is developed which consists of a nonlinear objective function and a set of implicit/explicit nonlinear constraints. A transformation method is adopted for minimization strategy, where the primal model constrained problem is transformed into a sequence of unconstrained minimization models. The search strategy is based on the well-known Fletcher/Powell algorithm. The finite element technique is adopted for discretization and analysis strategies. Mindlin theory is selected to simulate the finite element model and a selective reduced integration scheme is exploited to avoid a shear lock problem.