Solving certain singly constrained convex optimization problems in production planning (Q1170996): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q5532885 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial Problems: Reductibility and Approximation / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(82)90030-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022001077 / rank | |||
Normal rank | |||
Latest revision as of 10:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving certain singly constrained convex optimization problems in production planning |
scientific article |
Statements
Solving certain singly constrained convex optimization problems in production planning (English)
0 references
1982
0 references
convex optimization
0 references
production planning
0 references
one linear constraint
0 references
lower and upper bounds
0 references
Lagrange multiplier
0 references
polynomial time approximation scheme
0 references
approximation
0 references
computational complexity
0 references
