A finite algorithm for concave minimization over a polyhedron (Q3705227): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/nav.3800320119 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3800320119 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089656647 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NAV.3800320119 / rank | |||
Normal rank | |||
Latest revision as of 16:54, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finite algorithm for concave minimization over a polyhedron |
scientific article |
Statements
A finite algorithm for concave minimization over a polyhedron (English)
0 references
1985
0 references
polyhedral domain
0 references
nonseparable concave function
0 references
branch-and-bound type
0 references
globally optimal extreme point solution
0 references
linear programming subproblems
0 references
computational experience
0 references
bilinear programming
0 references
