A Simplex Method for a Class of Nonconvex Separable Problems

1 September 1970

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 17 (1) , 66-77
https://doi.org/10.1287/mnsc.17.1.66

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.

Keywords

FUNCTIONS
SIMPLEX METHOD
COMPOSED
CONCAVE
PROCEDURE
CLASS OF NONCONVEX
FEASIBLE SOLUTION

All Related Versions

Version 1, RePEc (Unconfirmed version)

This publication has 0 references indexed in Scilit: