Approximate feasible direction method for stochastic programming problems with recourse. linear inequality deterministic constraints (Q5202518)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4195716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8341348171234131
0 references
0.831127405166626
0 references
0.8182644248008728
0 references
