• Title/Summary/Keyword: Integer linear programming

Search Result 256, Processing Time 0.027 seconds

Solving A Quadratic Fractional Integer Programming Problem Using Linearization

  • Gaur, Anuradha;Arora, S.R.
    • Management Science and Financial Engineering
    • /
    • v.14 no.2
    • /
    • pp.25-44
    • /
    • 2008
  • This paper concentrates on reduction of a Quadratic Fractional Integer Programming Problem (QFIP) to a 0-1 Mixed Linear Programming Problem (0-1 MLP). The solution technique is based on converting the integer variables to binary variables and then the resulting Quadratic Fractional 0-1 Programming Problem is linearized to a 0-1 Mixed Linear Programming problem. It is illustrated with the help of a numerical example and is solved using the LINDO software.

An Integer Programming-based Local Search for the Multiple-choice Multidimensional Knapsack Problem

  • Hwang, Junha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.12
    • /
    • pp.1-9
    • /
    • 2018
  • The multiple-choice multidimensional knapsack problem (MMKP) is a variant of the well known 0-1 knapsack problem, which is known as an NP-hard problem. This paper proposes a method for solving the MMKP using the integer programming-based local search (IPbLS). IPbLS is a kind of a local search and uses integer programming to generate a neighbor solution. The most important thing in IPbLS is the way to select items participating in the next integer programming step. In this paper, three ways to select items are introduced and compared on 37 well-known benchmark data instances. Experimental results shows that the method using linear programming is the best for the MMKP. It also shows that the proposed method can find the equal or better solutions than the best known solutions in 23 data instances, and the new better solutions in 13 instances.

Optimizing delivery routing problem for logistics companies based on Integer Linear Programming method

  • Cao, Ngoc-Anh;Phan, Thanh-Hang;Chinh, Nguyen Thi;Tran, Duc-Quynh;Nguyen, Ha-Nam;Trang, Ngo-Thi-Thu;Choi, Gyoo-Seok
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.212-221
    • /
    • 2022
  • Currently, issues related to freight at Vietnamese logistics companies are becoming more and more urgent because of typical problems in Vietnam such as traffic, infrastructure, and application of information technology. This problem has been studied by applying many different approaches such as Integer Programming (LP), Mixed Integer Programming (MIP), hybrid, meta search, … In this paper, we applied the ILP model in order to deal with the VRP problem in a small size logistics company which is very popular in Vietnam. The experiments showed promising results with some optimal solutions with some small extra costs.

THE USE OF MATHEMATICAL PROGRAMMING FOR LINEAR REGRESSION PROBLEMS

  • Park, Sung-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.3 no.1
    • /
    • pp.75-79
    • /
    • 1978
  • The use of three mathematical programming techniques (quadratic programming, integer quadratic programming and linear programming) is discussed to solve some problems in linear regression analysis. When the criterion is the minimization of the sum of squared deviations and the parameters are linearly constrained, the problem may be formulated as quadratic programming problem. For the selection of variables to find "best" regression equation in statistics, the technique of integer quadratic programming is proposed and found to be a very useful tool. When the criterion of fitting a linear regression is the minimization of the sum of absolute deviations from the regression function, the problem may be reduced to a linear programming problem and can be solved reasonably well.ably well.

  • PDF

Power-Delay Product Optimization of Heterogeneous Adder Using Integer Linear Programming (정수선형계획법을 이용한 이종가산기의 전력-지연시간곱 최적화)

  • Kwak, Sang-Hoon;Lee, Jeong-Gun;Lee, Jeong-A
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.10
    • /
    • pp.1-9
    • /
    • 2010
  • In this paper, we propose a methodology in which a power-delay product of a binary adder is optimized based on the heterogeneous adder architecture. We formulate the power-delay product of the heterogeneous adder by using integer linear programming(ILP). For the use of ILP optimization, we adopt a transformation technique in which the initial non-linear expression for the power-delay product is converted into linear expression. The experimental result shows the superiority of the suggested method compared to the cases in which only conventional adder is used.

Expressions of K-Anonymity with Integer Programming

  • Run, Cui;Kim, H.J.
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.11a
    • /
    • pp.366-368
    • /
    • 2011
  • In this paper, we introduce a new kind of expressions for privacy protection techniques in database, such as K-anonymity L-diversity and t-closeness. With such kind of expressions, we provide a new way to solve the privacy protection problems, such as Linear programming, Non-linear programming, Integer programming and so on. Also most of the heuristic techniques are also efficient to be adopted under the expressions given.

  • PDF

Design of Mixed Integer Linear Programming Model for Transportation Planning (혼합 정수 선형 계획법을 이용한 수송 계획 모델 설계)

  • Park, Yong Kuk;Lee, Min Goo;Jung, Kyung Kwon;Won, Young-Jin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.11
    • /
    • pp.166-174
    • /
    • 2016
  • In this paper, we developed a mixed-integer linear programming model for transportation planning of athletes in sports events. The transportation planning of athletes involves finding the lowest-cost and fastest-time plan for distributing athletes from multiple accommodation to stadium. The decision variables associate with the number of driving events, and the total transportation cost is the objective function that needs to be minimized. The proposed method uses mixed integer linear programming to solve transportation problem, thus the global optimality is guaranteed. In order to verify the effectiveness of proposed method, we performed simulation and built the sports event management service platform (SEMSP) for transportation planning.

A Mixed Integer Linear Programming Approach for the Profit Based Unit Commitment Problem under Non-Linear Fuel Consumption Constraint and Maintenance Cost (비선형 연료 제약 및 유지보수 비용을 고려한 Mixed Integer Linear Programming 기반 발전기 주간 운용계획 최적화)

  • Song, Sang-Hwa;Lee, Kyung-Sik
    • Korean Management Science Review
    • /
    • v.25 no.1
    • /
    • pp.43-53
    • /
    • 2008
  • This paper considers a profit-based unit commitment problem with fuel consumption constraint and maintenance cost, which is one of the key decision problems in electricity industry. The nature of non-linearity inherent in the constraints and objective functions makes the problem intractable which have led many researches to focus on Lagrangian based heuristics. To solve the problem more effectively, we propose mixed integer programming based solution algorithm linearizing the complex non-linear constraints and objectives functions. The computational experiments using the real-world operation data taken from a domestic electricity power generator show that the proposed algorithm solves the given problem effectively.

On-Chip Crossbar Network Topology Synthesis using Mixed Integer Linear Programming (Mixed Integer Linear Programming을 이용한 온칩 크로스바 네트워크 토폴로지 합성)

  • Jun, Minje;Chung, Eui-Young
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.1
    • /
    • pp.166-173
    • /
    • 2013
  • As the number of IPs and the communication volume among them have constantly increased, on-chip crossbar network is now the most widely-used on-chip communication backbone of contemporary SoCs. The on-chip crossbar network consists of multiple crossbars and the connections among the IPs and the crossbars. As the complexity of SoCs increases, it has also become more and more complex to determine the topology of the crossbar network. To tackle this problem, this paper proposes an on-chip crossbar network topology method for application-specific systems. The proposed method uses mixed integer linear programming to solve the topology synthesis problem, thus the global optimality is guaranteed. Unlike the previous MILP-based methods which represent the topology with adjacency matrixes of IPs and crossbar switches, the proposed method uses the communication edges among IPs as the basic element of the representation. The experimental results show that the proposed MILP formulation outperforms the previous one by improving the synthesis speed by 77.1 times on average, for 4 realistic benchmarks.

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