-

 

 

 




Optimization Online





 

Facets of a mixed-integer bilinear covering set with bounds on variables

Hamidur Rahman(hrahman***at***iitb.ac.in)
Ashutosh Mahajan(amahajan***at***iitb.ac.in)

Abstract: We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is completely determined by considering some orthogonal disjunctive sets defined in a certain way. Our description does not introduce any new variables. We also derive a linear time separation algorithm for finding the facet defining inequalities of this convex hull. We show the effectiveness of the new inequalities using some examples.

Keywords: Bilinear programming, mixed-integer programming, convex hull, separation

Category 1: Global Optimization (Theory )

Category 2: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation: Industrial Engineering and Operations Research, IIT Bombay, July 2017

Download: [PDF]

Entry Submitted: 07/18/2017
Entry Accepted: 07/23/2017
Entry Last Modified: 07/18/2017

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society