A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems (Q799488)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems |
scientific article |
Statements
A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems (English)
0 references
1985
0 references
In this paper, primal and dual cutting plane algorithms for the solution of posynomial geometric programming problems are presented. It is shown that these cuts are deepest, in the sense that they cut off as much of the infeasible set as possible. Problems of nondifferentiability in the dual cutting plane are circumvented by the use of a subgradient. Although the resulting dual problem seems easier to solve, the computational experience seems to show that the primal cutting plane outperforms the dual.
0 references
subgradients
0 references
primal and dual cutting plane algorithms
0 references
posynomial geometric programming
0 references
nondifferentiability
0 references
computational experience
0 references