Analysis of a class of proxy problems (Q801816): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Stochastic spanning tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial time algorithm for a chance-constrained single machine scheduling problem / rank | |||
Normal rank | |||
Latest revision as of 15:13, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of a class of proxy problems |
scientific article |
Statements
Analysis of a class of proxy problems (English)
0 references
1984
0 references
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)].
0 references
sum objective function
0 references
proxy problems
0 references
