Linear programming with uncertain objective function: Minimax solution for relative loss (Q1137513): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soluzione minimax per problemi di programmazione lineare in condizioni di incertezza / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparametric Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding All Vertices of Convex Polyhedral Sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:31, 13 June 2024

scientific article
Language Label Description Also known as
English
Linear programming with uncertain objective function: Minimax solution for relative loss
scientific article

    Statements

    Linear programming with uncertain objective function: Minimax solution for relative loss (English)
    0 references
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multiparametric linear programming
    0 references
    stochastic objective function
    0 references
    fractional programming
    0 references