Please use this identifier to cite or link to this item:
Title: An integer linear programming approach for a class of bilinear integer programs
Authors: Hu, Wuhua
Tay, Wee Peng
Keywords: DRNTU::Engineering
Issue Date: 2014
Source: Hu, W., & Tay, W. P. (2014). An integer linear programming approach for a class of bilinear integer programs. Operations Research Letters, 42(3), 226-230.
Series/Report no.: Operations research letters
Abstract: We propose an Integer Linear Programming (ILP) approach for solving integer programming problems with bilinear objectives and linear constraints. Our approach is based on finding upper and lower bounds for the optimal bilinear objective function, and using the upper bound to produce a tight binary decomposition of an ensemble in the bilinear objective function. This allows us to transform the original problem into an equivalent ILP that can be solved efficiently. Numerical experiments suggest that the proposed approach outperforms a latest iterative ILP approach, with notable reductions in the average solution time.
DOI: 10.1016/j.orl.2014.03.002
Schools: School of Electrical and Electronic Engineering 
Rights: © 2014 Elsevier B.V. This is the author created version of a work that has been peer reviewed and accepted for publication by Operations Research Letters, Elsevier B.V. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [].
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Journal Articles

Files in This Item:
File Description SizeFormat 
An integer linear programming approach for a class of bilinear integer programs.pdf250.1 kBAdobe PDFThumbnail

Citations 50

Updated on Apr 8, 2024

Web of ScienceTM
Citations 50

Updated on Oct 30, 2023

Page view(s) 10

Updated on Apr 19, 2024

Download(s) 20

Updated on Apr 19, 2024

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.