Two-Segment Separable Programming

R. R. Meyer
Additional contact information
R. R. Meyer: University of Wisconsin-Madison

Management Science, 1979, vol. 25, issue 4, 385-395

Abstract: New iterative separable programming techniques based on two-segment, piecewise-linear approximations are described for the minimization of convex separable functions over convex sets. These techniques have two advantages over traditional separable programming methods. The first is that they do not require the cumbersome "fine grid" approximations employed to achieve high accuracy in the usual separable programming approach. In addition, the new methods yield feasible solutions with objective values guaranteed to be within any specified tolerance of optimality. In computational tests with real-world problems of up to 500 "nonlinear" variables the approach has exhibited rapid convergence and yielded very close bounds on the optimal value.

Keywords: programming: nonlinear algorithms; programming: convex; separable (search for similar items in EconPapers)
Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.25.4.385 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:25:y:1979:i:4:p:385-395

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().