An integer linear programming approach for a class of bilinear integer programs
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...
Saved in:
Main Authors: | Hu, Wuhua, Tay, Wee Peng |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/101178 http://hdl.handle.net/10220/19643 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An algorithm for solving a class of bilinear integer programming problem
by: Tran, Xuan Sinh
Published: (2017) -
A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination
by: JEONG, Jihwan, et al.
Published: (2023) -
MULTI-PARAMETRIC INTEGER LINEAR PROGRAMMING
by: WANG RUI
Published: (2021) -
An integer programming problem with a linear programming solution
by: Jimenez, Jill Corinne, et al.
Published: (2002) -
Improving mixed integer linear programming formulations
by: Khurana, A., et al.
Published: (2014)