An algorithm for disjunctive programs (Q1173796): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(90)90419-c / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021947147 / rank | |||
Normal rank | |||
Latest revision as of 10:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for disjunctive programs |
scientific article |
Statements
An algorithm for disjunctive programs (English)
0 references
25 June 1992
0 references
The standard solution technique for linear problems complicated by disjunctions is to re-express each disjunction in terms of binary variables and solve the resulting mixed integer problem. An algorithm based on the logical relationships among constraints is proposed and its advantages are shown.
0 references
disjunctions
0 references
0 references
0 references
