Analysis of a class of proxy problems

DOI10.1016/0167-6377(84)90060-9zbMath0552.90075OpenAlexW2062192793MaRDI QIDQ801816

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)

Related Items (9)

Fractional programming revisited ⋮ C-programming: A nonlinear parametric optimization method ⋮ Analysis of a class of fractional programming problems ⋮ A stochastic programming process model for investment planning ⋮ 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 ⋮ C-programming. An outline ⋮ A class of nonseparable dynamic programming problems

Cites Work

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

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