Inner approximation algorithm for solving linear multiobjective optimization problems (Q5009156): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GLPK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BENSOLVE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3012502442 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1808.01786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benson type algorithms for linear vector optimization and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal and dual approximation algorithms for convex vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric duality and parametric duality for multiple objective linear programs are equivalent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vector linear program solver Bensolve -- notes on theoretical background / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are convex hull algorithms? / rank
 
Normal rank
Property / cites work
 
Property / cites work: New modification of the double description method for constructing the skeleton of a polyhedral cone / rank
 
Normal rank

Latest revision as of 11:20, 26 July 2024

scientific article; zbMATH DE number 7383634
Language Label Description Also known as
English
Inner approximation algorithm for solving linear multiobjective optimization problems
scientific article; zbMATH DE number 7383634

    Statements

    Inner approximation algorithm for solving linear multiobjective optimization problems (English)
    0 references
    0 references
    0 references
    19 August 2021
    0 references
    0 references
    multiobjective optimization
    0 references
    duality
    0 references
    vertex enumeration
    0 references
    double description
    0 references
    objective space
    0 references
    0 references
    0 references
    0 references
    0 references