Approximate feasible direction method for stochastic programming problems with recourse. linear inequality deterministic constraints (Q5202518): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An exact branch-and-bound procedure for the quadratic-assignment problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization and nonsmooth analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040713 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Feasible direction methods for stochastic programming problems / rank | |||
Normal rank | |||
Latest revision as of 15:11, 21 June 2024
scientific article; zbMATH DE number 4195716
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate feasible direction method for stochastic programming problems with recourse. linear inequality deterministic constraints |
scientific article; zbMATH DE number 4195716 |
Statements
Approximate feasible direction method for stochastic programming problems with recourse. linear inequality deterministic constraints (English)
0 references
1990
0 references
convex, continuously differentiable objective function
0 references
convex approximates
0 references
approximate feasible direction method
0 references
Fritz-John point
0 references
