• Title/Summary/Keyword: Mixed Integer Programming Model

Search Result 231, Processing Time 0.028 seconds

An Algorithm for Portfolio Selection Model

  • Kim, Yong-Chan;Shin, Ki-Young;Kim, Jong-Soo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.65-68
    • /
    • 2000
  • The problem of selecting a portfolio is to find Un investment plan that achieves a desired return while minimizing the risk involved. One stream of algorithms are based upon mixed integer linear programming models and guarantee an integer optimal solution. But these algorithms require too much time to apply to real problems. Another stream of algorithms are fur a near optimal solution and are fast enough. But, these also have a weakness in that the solution generated can't be guaranteed to be integer values. Since it is not a trivial job to tansform the scullion into integer valued one simutaneously maintaining the quality of the solution, they are not easy to apply to real world portfolio selection. To tackle the problem more efficiently, we propose an algorithm which generates a very good integer solution in reasonable amount of time. The algorithm is tested using Korean stock market data to verify its accuracy and efficiency.

  • PDF

Optimization of LCD Panel Cutting Problem Using 0-1 Mixed Integer Programming (0-1 혼합정수계획법을 이용한 LCD 패널 절단 문제 최적화)

  • Kim, Kidong;Park, Hyeon Ji;Shim, Yun-Seop;Jeon, Tae Bo
    • Journal of Sensor Science and Technology
    • /
    • v.26 no.4
    • /
    • pp.274-279
    • /
    • 2017
  • LCD(Liquid Crystal Display) panel cutting problem is a sort of two dimensional cutting stock problem. A cutting stock problem is problem that it minimizes the loss of the stock when a stock is cut into various parts. In the most research of the two dimensional cutting stock problem, it is supposed that the relative angle of a stock and parts is not important. Usually the angle is regarded as horizontal or perpendicular. In the manufacturing of polarizing film of LCD, the relative angle should be maintained at some specific angle because of the physical and/or chemical characteristics of raw material. We propose a mathematical model for solving this problem, a two-dimensional non-Guillotine cutting stock problem that is restricted by an arranged angle. Some example problems are solved by the C++ program using ILOG CPLEX classes. We could get the verification and validation of the suggested model based on the solutions.

MINIMIZATION OF PARENT ROLL TRIM LOSS FOR THE PAPER INDUSTRY

  • Bae, Hee-Man
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.3 no.2
    • /
    • pp.95-108
    • /
    • 1978
  • This paper discusses an application of mathematical programming techniques in the paper industry in determining optimal parent roll widths. Parent rolls are made from the reels produced at wide paper machines by slitting them to more manageable widths. The problem is finding a set of the slitting patterns that will minimize the trim loss involved in the sheeting operation. Two programming models, one linear and one mixed integer linear, are presented in this paper. Also presented are the computational experience, the model sensitivity, and the comparison of the optimal solutions with the simulated operational data.

  • PDF

A Study on Berth Allocation for Navy Surface Vessels Considering Precedence Relationships among Services (서비스 전후 우선순위를 고려한 해군함정의 선석 할당에 관한 연구)

  • Jung, Whan-Sik;Kim, Jae-Hee;Kim, Sheung-Kwon
    • Journal of Navigation and Port Research
    • /
    • v.28 no.1
    • /
    • pp.83-90
    • /
    • 2004
  • Navy surface vessels require pier services such as emergency repair, oil supply, arm loading / unloading, craning, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. This study suggests Mixed Integer Programming model for berth allocation problem, considering precedence relationships among services. For an effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 3.1 and ILOG CPLEX 7.0. The results of the model show reduction of berth shifts and increasement of service benefits.

A Study of Optimal Operation Policy using Risk Evaluation Criteria(II) (for the Han River Reservoirs System) (위험도 평가기준을 적용한 저수지 최적운영방안 연구(II) (한강수계 저수지군을 중심으로))

  • Park, Myeong-Gi;Kim, Jae-Han;Jeong, Gwan-Su
    • Journal of Korea Water Resources Association
    • /
    • v.35 no.1
    • /
    • pp.51-64
    • /
    • 2002
  • In this study, the formulation of the developed mixed-integer programming model for a multi-reservoir system including hydro-electric power generation (park et al., 2001) has been improved for multiple reservoir system operation using risk evaluation criteria. Sequential linear programming(SLP) was applied for the linearization of the hydro-electric energy term in the model. In order to allocate monthly reservoir release reasonably the value of weight for hydro-electric energy was assigned by level of power generation hour. The improved model was applied to the five reservoirs system in the Han river. And could be confirmed the availibility of new formulation appling risk evaluation criteria.

Stochastic Programming Approach to Scheduling Elective Surgeries and the Effects of Newsvendor Ratio on Operating Room Utilization (추계적 계획법을 이용한 수술실 예약 모델과 Newsvendor 비율의 자원 효율성에 대한 영향 분석)

  • Min, Dai-Ki
    • Korean Management Science Review
    • /
    • v.28 no.2
    • /
    • pp.17-29
    • /
    • 2011
  • The purpose of this paper is to schedule elective surgery patients using a stochastic programming approach and to illustrate how operating room utilization behaves when a decision-maker varies costs associated with utilization. Because of the uncertainty in surgery durations, the underage and overage costs that a decision-maker considers plays an important role in allocating surgery cases into available operating room capacity. We formulate the problem as a stochastic mixed integer programming and propose a sampling-based approximation method for a computational purpose. Newsvendor model is employed to explain the results from numerical experiments that are conducted with the actual data from a hospital. The results show that the operating room utilization is more sensitive when the unit overtime cost is relatively larger than the unit cost for underutilized time.

An Integrated Production-Inventory Model (통합생산재고모형(統合生産在庫模型)에 관한 연구(硏究))

  • No, In-Gyu;Park, Sang-Don
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.11 no.2
    • /
    • pp.29-37
    • /
    • 1985
  • This paper studies a production-inventory model which unifies the inventory problem of raw materials and the finished product for a single product manufacturing system. The integrated production-inventory model is formulated wth a nonlinear mixed integer programming problem. An algorithm is developed by utilizing the finite explicit enumeration method. The algorithm guarantees to generate an optimal policy for minimizing the total annual variable cost. A mumerical example involving 15 raw materials is given to illustrate the recommended solution procedure.

  • PDF

A Study on the Lot Sizing and Scheduling in Process Industries (장치 산업에서 로트 크기와 작업 순서 결정을 위한 연구)

  • 이호일;김만식
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.12 no.19
    • /
    • pp.79-88
    • /
    • 1989
  • This characteristics of process industries are high capital intensity, relatively long and sequence dependent setup times, and extremely limited capacity resources. The lot sizing, sequencing and limited capacity resources factors must he considered for production scheduling in these industries. This paper presents a mixed integer programming model for production scheduling. The economic trade offs between capacitated lot sizing flow shop scheduling and sequence dependent setup times also be compared with SMITH-DANIELS's model. As a results, it is shown that this paper has lower total cost, more efficient throughput than SMITH-DANIELS's model.

  • PDF

An Interactive Multi-criteria Group Decision Making with the Minimum Distance Measure (최소 거리척도를 이용한 대화형 다기준 그룹 의사결정)

  • Cho, Namwoong;Kim, Jaehee;Kim, Sheung-Kown
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.32 no.1
    • /
    • pp.42-50
    • /
    • 2006
  • The multi-criteria group decision making (MCGDM) problem is to determine the best compromise solution in a set of competing alternatives that are evaluated under conflicting criteria by decision maker (DM)s. In this paper, we propose a mixed-integer programming (MIP) model to solve MCGDM. The existing method based on minimizing a distance measure such as Median Approach can not guarantee the best compromise solution because the element of median point vector is defined with respect to each criteria separately. However, by considering all criteria simultaneously, we generate median point that is better for locating the best compromise solution. We also utilize the concept of spatial dispersion index (SDI) to produce a threshold value, which is used as a guideline to choose either the Utopian Approach or the Median Approach. And we suggest using CBITP (Convex hull of individual maxima Based Interactive Tchebycheff Procedure) to provide DMs with various Pareto-optimal solutions so that DMs have broad range of selection.

A Study on Optimal Design of Single Periodic, Multipurpose Batch Plants

  • Rhee, In-Hyoung;Cho, Dae-Chul
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.3 no.1
    • /
    • pp.10-19
    • /
    • 2002
  • The purpose of this paper is to describe the design of a general multipurpose batch process or plant in terms of a series of mathematical programing models, and to develop approach solution methodologies. The proposed model for a single period is based on the formulation (MINLP; Mixed Integer Nonlinear Programming) of Papageorgaki and Reklaitis [1], but was linearized (MILP; Mixed Integer Linear Programming) so as to obtain an exact and practical solution, and to allow treatment of uncertainties to be considered in expanding the plant. As a solution strategy a modified Benders' Decomposition was introduced and was tested on three example problems. The optimizing solver, OSL code provided by the IBM Corporation, was used for solving the problems. The solution method was successful in that it showed remarkable reduction in the computing times as compared with the direct solution method.

  • PDF