Using aspiration levels in an interactive interior multiobjective linear programming algorithm (Q1266671): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An interior multiobjective linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prospect Theory: An Analysis of Decision under Risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A visual interactive method for solving the multiple criteria problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive multiple objective optimization: Survey. I: Continuous case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness and constructiveness of parametric characterizations to vector optimization problems / rank
 
Normal rank

Latest revision as of 16:36, 28 May 2024

scientific article
Language Label Description Also known as
English
Using aspiration levels in an interactive interior multiobjective linear programming algorithm
scientific article

    Statements

    Using aspiration levels in an interactive interior multiobjective linear programming algorithm (English)
    0 references
    0 references
    0 references
    18 March 1999
    0 references
    0 references
    scalarizing functions
    0 references
    affine-scaling primal algorithm
    0 references
    interior-point linear programming
    0 references
    multiple objective linear programming
    0 references
    aspiration levels
    0 references