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

DOI10.1016/0166-218X(84)90029-5zbMATH Open0545.90090OpenAlexW2024794819MaRDI QIDQ798261FDOQ798261

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)

Cites Work

• Stochastic spanning tree problem

Cited In (10)

• A Solution Strategy for a Class of Nonlinear Knapsack Problems
• C-programming and the minimization of pseudolinear and additive concave functions
• Fractional programming revisited
• A class of nonseparable dynamic programming problems
• On pseudolinear functions
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• 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: A nonlinear parametric optimization method
• Analysis of a class of fractional programming problems

   Recommendations

• C-programming. An outline 👍 👎
• C-programming: A nonlinear parametric optimization method 👍 👎
• The complexity of a special convex programming problem connected with nonlinear optimization 👍 👎
• Title not available (Why is that?) 👍 👎
• Global minimization of a generalized convex multiplicative function 👍 👎

This page was built for publication: C-programming problems: A class of non-linear optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798261)