Analysis of a class of proxy problems

DOI10.1016/0167-6377(84)90060-9MaRDI QIDQ801816zbMATH OpenOpenAlexFDO

Authors Moshe Sniedovich

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0167-6377(84)90060-9

zbMATH Keywords

proxy problemssum objective function

Mathematics Subject Classification ID

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

Recommendations

• Proximal minimization algorithm with \(D\)-functions
• scientific article; zbMATH DE number 4042659
• scientific article; zbMATH DE number 2221962
• A problem on convex functions
• On minimizing the sum of a convex function and a concave function

Cites work

• A polynomial time algorithm for a chance-constrained single machine scheduling problem
• Stochastic spanning tree problem

Cited in

(9)

• A Solution Strategy for a Class of Nonlinear Knapsack Problems
• A stochastic programming process model for investment planning
• C-programming and the minimization of pseudolinear and additive concave functions
• Fractional programming revisited
• C-programming. An outline
• A class of nonseparable dynamic programming problems
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• C-programming: A nonlinear parametric optimization method
• Analysis of a class of fractional programming problems

This page was built for publication: Analysis of a class of proxy problems

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