C-programming: A nonlinear parametric optimization method
From MaRDI portal
Publication:1119478
DOI10.1016/0898-1221(88)90193-9zbMath0671.90077MaRDI QIDQ1119478
Publication date: 1988
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(88)90193-9
90C30: Nonlinear programming
90C31: Sensitivity, stability, parametric optimization
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Solution strategies for variance minimization problems, A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program, Experiments with dynamic programming algorithms for nonseparable problems
Cites Work
- Unnamed Item
- C-programming problems: A class of non-linear optimization problems
- Analysis of a class of proxy problems
- A new look at Bellman's principle of optimality
- C-programming. An outline
- A class of nonseparable dynamic programming problems
- The shortest path problem with two objective functions
- Fractional programming revisited
- On Nonlinear Fractional Programming
- Solving Bicriterion Mathematical Programs
- Fractional programming