C-programming: A nonlinear parametric optimization method
C-programming is the technique for the solution of such nonlinear optimization problems which are not solvable by standard optimization methods and which have objective functions of a composed form, e.g. an external pseudolinear function and a convex one, or a convex additive and a separable one. A certain nonlinear parametric optimization problem (which has a linear objective function with regard to the parameters) is defined to the nonlinear optimization problem so that a solution of the former will be tantamount to a solution of the latter. C-programming is thus the nonlinear parametric optimization method. The paper is closely connected to former papers of the author and it provides an overview of the methodological, theoretical and computational aspects of C- programming.
- 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
- 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
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- On Nonlinear Fractional Programming
- Solving Bicriterion Mathematical Programs
- The shortest path problem with two objective functions
- C-programming. An outline
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- Experiments with dynamic programming algorithms for nonseparable problems
- Multiplicative programming and beyond via C-programming.
- scientific article; zbMATH DE number 1471810 (Why is no real title available?)
- On mean-standard deviation ratio problems and beyond via c-programming
- Algorithmic and computational aspects of composite concave programming
- C-programming problems: A class of non-linear optimization problems
- Solution strategies for variance minimization 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)
