C-programming problems: A class of non-linear optimization problems

DOI10.1016/0166-218X(84)90029-5zbMath0545.90090OpenAlexW2024794819MaRDI QIDQ798261

Moshe Sniedovich

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(84)90029-5

zbMATH Keywords

c-programming problemsobjective function of sum type

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Fractional programming revisited ⋮ C-programming: A nonlinear parametric optimization method ⋮ Analysis of a class of fractional programming problems ⋮ On pseudolinear functions ⋮ An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion ⋮ A fully polynomial time approximation scheme for minimum cost-reliability ratio problems ⋮ C-programming and the minimization of pseudolinear and additive concave functions ⋮ A Solution Strategy for a Class of Nonlinear Knapsack Problems ⋮ A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program ⋮ A class of nonseparable dynamic programming problems

Cites Work

• Stochastic spanning tree problem