Approximate feasible direction method for stochastic programming problems with recourse. linear inequality deterministic constraints (Q5202518)

From MaRDI portal
Revision as of 18:38, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    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

    Identifiers