Approximate feasible direction method for stochastic programming problems with recourse. linear inequality deterministic constraints (Q5202518): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:03, 8 February 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
