A Simplex Method for a Class of Nonconvex Separable Problems

Guy Alloin
Additional contact information
Guy Alloin: CORE, University of Louvain, Belgium

Management Science, 1970, vol. 17, issue 1, 66-77

Abstract: In this paper we present an extension of the simplex procedure to deal with separable programming problems where the objective is composed of functions which are either convex or concave and where the feasible solution set is convex.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.1.66 (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:17:y:1970:i:1:p:66-77

Access Statistics for this article

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