A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (Q3762072)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4012315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems |
scientific article; zbMATH DE number 4012315 |
Statements
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (English)
0 references
1986
0 references
linearization techniques
0 references
zero-one quadratic programming
0 references
mixed-integer linear programming problem
0 references
Lagrangian relaxation
0 references
implicit enumeration
0 references
Benders' cutting planes
0 references
0.8504963517189026
0 references
0.8381890654563904
0 references
0.832333505153656
0 references
0.8320956826210022
0 references
0.8299936652183533
0 references
Let QP be a zero-one quadratic programming problem given by: \[ \min imize\quad \sum^{m}_{i=1}c_ ix_ i+\sum^{m- 1}_{i=1}\sum^{m}_{j=i+1}D_{ij}x_ ix_ j, \] \[ x\in X=X_ 1\cap X_ 2\cap X_ 3;\quad X_ 1=\{x: \sum^{m}_{i=1}a_{ki}x_ i=b_ k\}; \] \[ X_ 2=\{x: \sum^{m}_{i=1}G_{ri}x_ i\geq d_ r\};\quad X_ 3=\{x;\quad 0\leq x_ i\leq 1;\quad i=1,...,m\}. \] Some procedures developed for the solution of problem QP are reviewed. In this paper the authors transform QP into a new equivalent mixed-integer linear programming problem, MIP. A new algorithm to solve the problem MIP is proposed which is based upon Lagrangian relaxation and an implicit enumeration strategy that uses a combination of the breadth-and-depth- first methods and generates Benders' cutting planes. Some computational experience is provided. It is mentioned that the new algorithm is preferable to others in obtainig quickly a good approximation in numerous economic problems.
0 references