A Simplex Method for a Class of Nonconvex Separable Problems

DOI10.1287/MNSC.17.1.66MaRDI QIDQ5623526zbMATH OpenOpenAlexFDO

Authors G. Alloin

Publication date 1970

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.17.1.66

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cited in

(1)

• Using shortest paths in some transshipment problems with concave costs

This page was built for publication: A Simplex Method for a Class of Nonconvex Separable Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5623526)