C-programming: A nonlinear parametric optimization method
From MaRDI portal
Recommendations
- Algorithmic and computational aspects of composite concave programming
- The simplex method as a global optimizer: A C-programming perspective
- C-programming problems: A class of non-linear optimization problems
- C-programming. An outline
- C-programming and the minimization of pseudolinear and additive concave functions
Cites work
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- A class of nonseparable dynamic programming problems
- A new look at Bellman's principle of optimality
- Analysis of a class of proxy problems
- C-programming problems: A class of non-linear optimization problems
- C-programming. An outline
- Fractional programming
- Fractional programming revisited
- On Nonlinear Fractional Programming
- Solving Bicriterion Mathematical Programs
- The shortest path problem with two objective functions
Cited in
(8)- Multiplicative programming and beyond via \(C\)-programming.
- C-programming problems: A class of non-linear optimization problems
- C-programming. An outline
- scientific article; zbMATH DE number 1471810 (Why is no real title available?)
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- Algorithmic and computational aspects of composite concave programming
- Solution strategies for variance minimization problems
- Experiments with dynamic programming algorithms for nonseparable problems
This page was built for publication: C-programming: A nonlinear parametric optimization method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119478)
