C-programming. An outline

DOI10.1016/0167-6377(85)90045-8MaRDI QIDQ1060962zbMATH OpenOpenAlexFDO

Authors Moshe Sniedovich

Publication date 1985

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(85)90045-8

zbMATH Keywords

c-programmingcomposite objective functionconvex functionsLagrangian problemssum objective

Mathematics Subject Classification ID

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

Review text

This paper presents the essentials of a method designed to solve optimization problems whose objective functions are of the form \(g(x)+\psi (u(x))\), where \(\psi\) is differentiable and either concave or convex. It is shown that solutions to such problems can be obtained through the solutions of the Lagrangian problem whose objective function is of the form \(g(x)+\lambda u(x)\).

Recommendations

• C-programming problems: A class of non-linear optimization problems
• C-programming: A nonlinear parametric optimization method
• Linear programs and implicit functions
• C-programming and the minimization of pseudolinear and additive concave functions
• The complexity of a special convex programming problem connected with nonlinear optimization

Cites work

• An approach to nonlinear programming
• Analysis of a class of proxy problems

Cited in

(18)

• A class of nonseparable dynamic programming problems
• Fractional programming revisited
• C-programming: A nonlinear parametric optimization method
• Analysis of a class of fractional programming problems
• An -approximation scheme for combinatorial optimization problems with minimum variance criterion
• A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
• The simplex method as a global optimizer: A C-programming perspective
• Linearization method for constrained limit extremal problems
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• Experiments with dynamic programming algorithms for nonseparable problems
• The joint replenishment problem with variable production costs
• scientific article; zbMATH DE number 576322 (Why is no real title available?)
• scientific article; zbMATH DE number 591895 (Why is no real title available?)
• A Solution Strategy for a Class of Nonlinear Knapsack Problems
• Linear programs and implicit functions
• C-programming and the minimization of pseudolinear and additive concave functions
• C-programming problems: A class of non-linear optimization problems
• Solution strategies for variance minimization problems

This page was built for publication: C-programming. An outline

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