Solving certain singly constrained convex optimization problems in production planning Export

@article{citeulike:4613234, 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.}, author = {Ziegler, H.}, citeulike-article-id = {4613234}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/0167-6377(82)90030-X}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/0167-6377(82)90030-X}, doi = {10.1016/0167-6377(82)90030-X}, issn = {01676377}, journal = {Operations Research Letters}, keywords = {article, masters, optimization}, month = {December}, number = {6}, pages = {246--252}, posted-at = {2009-05-23 21:18:51}, priority = {2}, title = {Solving certain singly constrained convex optimization problems in production planning}, url = {http://dx.doi.org/10.1016/0167-6377(82)90030-X}, volume = {1}, year = {1982} }

TY - JOUR ID - citeulike:4613234 L3 - citeulike-article-id:4613234 N2 - 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. IS - 6 JF - Operations Research Letters SN - 01676377 EP - 252 TI - Solving certain singly constrained convex optimization problems in production planning VL - 1 SP - 246 KW - article KW - masters KW - optimization AU - Ziegler, H PY - 1982/12// UR - http://dx.doi.org/10.1016/0167-6377(82)90030-X ER -