Analysis of a class of proxy problems
From MaRDI portal
This paper contains 4 lemmas, 3 theorems and 2 corollaries to show that minimization problems involving objective functions of the form \(g(x)+\phi (u(x))\), where \(\phi\) is concave, can be solved by means of proxy problems, the objective function of which is of the form \(g(x)+\lambda u(x)\). the authors also use the theorems to construct a counterexample to a theorem of \textit{N. Katoh} and \textit{t. Ibaraki} [ibid. 2, 62-65 (1983; Zbl 0506.90039)].
Recommendations
Cites work
Cited in
(9)- C-programming. An outline
- 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
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- 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
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)