An Algorithm for Separable Nonconvex Programming Problems

James E. Falk and Richard M. Soland
Additional contact information
James E. Falk: Research Analysis Corporation
Richard M. Soland: Research Analysis Corporation

Management Science, 1969, vol. 15, issue 9, 550-569

Abstract: In this paper we present an algorithm for solving mathematical programming problems of the form: Find x - (x 1 ,..., x n ) to minimize \sum \varphi i (x i ) subject to x \in G and l i is assumed to be lower semicontinuous, possibly nonconvex, and G is assumed to be closed. The algorithm is of the branch and bound type and solves a sequence of problems in each of which the objective function is convex. These problems correspond to successive partitions of the feasible set. Two different rules for refining the partitions are considered; these lead to convergence of the algorithm under different requirements on the problem functions. Examples are given, and computational considerations are discussed.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (41)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.15.9.550 (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:15:y:1969:i:9:p:550-569

Access Statistics for this article

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