A disjunctive cutting plane algorithm for the extreme point mathematical programming problem (Q1058456): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:04, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A disjunctive cutting plane algorithm for the extreme point mathematical programming problem |
scientific article |
Statements
A disjunctive cutting plane algorithm for the extreme point mathematical programming problem (English)
0 references
1985
0 references
We develop a finitely convergent cutting plane algorithm for the extreme point mathematical programming problem. Two types of disjunctive cutting planes are used. One is based on a combinatorial disjunction, and the other is a disjunctive face cut. Other existing methods for this problem are limited to certain dual types of extreme point ranking techniques (which do not find a feasible solution until optimality) and some non- convergent cutting plane algorithms, for all of which no computational experience exists. We provide computational experience for the problem, and include a heuristic for obtaining good starting solutions.
0 references
cutting plane algorithm
0 references
extreme point mathematical programming problem
0 references
computational experience
0 references