On duality for Boolean programming (Q750292): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(90)90016-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971940064 / rank | |||
Normal rank | |||
Revision as of 19:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On duality for Boolean programming |
scientific article |
Statements
On duality for Boolean programming (English)
0 references
1990
0 references
The paper presents a survey on duality for Boolean programming. The author discusses ways to obtain sharp bounds for branch-and-bound algorithms. Linear and nonlinear objective functions and nonlinear representations of the Boolean restrictions on the variables are used in the primal problem to get various forms for the dual problem.
0 references
surrogate problem
0 references
penalty function
0 references
survey on duality
0 references
sharp bounds
0 references
branch-and-bound
0 references
