Solving certain singly constrained convex optimization problems in production planning

Authors:
Hans Ziegler
Affiliations:
Fachbereich Wirtschaftswissenschaft, Universität Gesamthochschule Paderborn, Warburger Strasse 100, D-4790 Paderborn, Fed. Rep. Germany
Venue:
Operations Research Letters
Year:
1982

Citing 0
Cited 4

Production and inventory management under multiple resource constraints

Mathematical and Computer Modelling: An International Journal
A nonlinear Knapsack problem

Operations Research Letters
On a discrete nonlinear and nonseparable knapsack problem

Operations Research Letters
A note on multi-item inventory systems with limited capacity

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of minimizing a special convex function subject to one linear constraint. Based upon a theorem for lower and upper bounds on the Lagrange multiplier a fully polynomial time approximation scheme is proposed. The efficiency of the algorithm is demonstrated by a computational experiment.