An algorithm for disjunctive programs (Q1173796): Difference between revisions

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

reviewed by

J.Mitev

0 references

zbMATH Keywords

disjunctions

0 references

describes a project that uses

SCICONIC

0 references

MINOS

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Correction to ''Disjunctive programming''

0 references

Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems

0 references

Q4079613

0 references

Q3904339

0 references

Integer Programming Algorithms: A Framework and State-of-the-Art Survey

0 references

Modelling with integer variables

0 references

Q4404428

0 references

Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm

0 references

Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions

0 references

Optimization with disjunctive constraints

0 references

Q3347628

0 references

full work available at URL

https://doi.org/10.1016/0377-2217(90)90419-c

0 references

Identifiers

zbMATH Open document ID

0744.90062

0 references

DOI

10.1016/0377-2217(90)90419-C

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1173796

@@ Property / describes a project that uses @@
+MINOS
@@ Property / describes a project that uses: MINOS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Correction to ''Disjunctive programming''
@@ Property / cites work: Correction to ''Disjunctive programming'' / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+Q4079613
@@ Property / cites work: Q4079613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3904339
@@ Property / cites work: Q3904339 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Algorithms: A Framework and State-of-the-Art Survey
+Normal rank
@@ Property / cites work @@
+Modelling with integer variables
@@ Property / cites work: Modelling with integer variables / rank @@
+Normal rank
@@ Property / cites work @@
+Q4404428
@@ Property / cites work: Q4404428 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
+Normal rank
@@ Property / cites work @@
+Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
+Normal rank
@@ Property / cites work @@
+Optimization with disjunctive constraints
@@ Property / cites work: Optimization with disjunctive constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q3347628
@@ Property / cites work: Q3347628 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(90)90419-c
+Normal rank
@@ Property / OpenAlex ID @@
+W2021947147
@@ Property / OpenAlex ID: W2021947147 / rank @@
+Normal rank