C-programming: A nonlinear parametric optimization method

DOI10.1016/0898-1221(88)90193-9zbMath0671.90077OpenAlexW2019098589MaRDI QIDQ1119478

Moshe Sniedovich

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

zbMATH Keywords

overviewC-programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Experiments with dynamic programming algorithms for nonseparable problems ⋮ A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program ⋮ Solution strategies for variance minimization 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