Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution (Q5202511): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3229784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5336851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming under uncertainty: A basic property of the optimal solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete moment problem and linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving stochastic programs with simple recourse / rank
 
Normal rank

Revision as of 16:11, 21 June 2024

scientific article; zbMATH DE number 4195706
Language Label Description Also known as
English
Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
scientific article; zbMATH DE number 4195706

    Statements

    Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    discretely distributed random right hand side
    0 references
    penalty term
    0 references
    \(\lambda \) - representation of univariate piecewise linear convex functions
    0 references