A two-segment approximation algorithm for separable convex programming with linear constraints (Q3724100)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-segment approximation algorithm for separable convex programming with linear constraints |
scientific article |
Statements
A two-segment approximation algorithm for separable convex programming with linear constraints (English)
0 references
1986
0 references
two-segment approximation
0 references
separable convex programming
0 references
linear constraints
0 references
approximation of the objective function
0 references
sequence of feasible solutions
0 references
Computational tests
0 references
