Algorithmic and computational aspects of composite concave programming

DOI10.1016/0969-6016(94)90047-7MaRDI QIDQ4888229zbMATH OpenOpenAlexFDO

Authors Moshe Sniedovich

Publication date 19 January 1997

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0969-6016(94)90047-7

zbMATH Keywords

c-programmingparametric nonlinear optimization

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Dynamic programming (90C39)

Recommendations

• C-programming: A nonlinear parametric optimization method
• The simplex method as a global optimizer: A C-programming perspective
• C-programming and the minimization of pseudolinear and additive concave functions
• A note on composite concave quadratic programming
• scientific article; zbMATH DE number 1421096

Cited in

(10)

• A conical algorithm for solving a class of complementarity problems
• C-programming: A nonlinear parametric optimization method
• A note on composite concave quadratic programming
• Piecewise-convex maximization problems: algorithm and computational experiments
• Experiments with dynamic programming algorithms for nonseparable problems
• Composite convex programs
• scientific article; zbMATH DE number 519872 (Why is no real title available?)
• HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS
• Generalized linear programming and sensitivity analysis techniques
• C-programming and the minimization of pseudolinear and additive concave functions

This page was built for publication: Algorithmic and computational aspects of composite concave programming

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