STRANGE: An interactive method for multi-objective linear programming under uncertainty (Q1082254): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 00:52, 31 January 2024

scientific article
Language Label Description Also known as
English
STRANGE: An interactive method for multi-objective linear programming under uncertainty
scientific article

    Statements

    STRANGE: An interactive method for multi-objective linear programming under uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    In the field of investment planning within a time horizon, problems typically involve multiple objectives, and basic data are uncertain. In a large number of cases, these decision problems can be written as linear programming problems in which time dependent uncertainties affect the coefficients and the right hand side of constraints. Given the possibility of defining plausible scenarios on basic data, discrete sets of such coefficients are given, each with its subjective probability of occurrence. The correspondence structure is then characteristic for Multi-Objective Stochastic Linear Programming (MOSLP). An interactive procedure is described to obtain a best compromise for such a MOSLP problem. This algorithm, called STRANGE, extends the STEM method to take the random aspects into account. It involves in particular, the concepts of stochastic programming with recourse. In its interactive steps, the efficiency projection techniques are used to provide the decision-maker with detailed graphical information on efficient solution families. As an illustration of the successive steps, a didactic example is solved in some detail and the results of a case study in energy planning are given.
    0 references
    investment planning
    0 references
    multiple objectives
    0 references
    time dependent uncertainties
    0 references
    Multi-Objective Stochastic Linear Programming
    0 references
    interactive procedure
    0 references
    best compromise
    0 references
    STRANGE
    0 references
    recourse
    0 references

    Identifiers