An algorithm to solve polyhedral convex set optimization problems (Q4916312): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The quickhull algorithm for convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further analysis of an outcome set-based algorithm for multiple-objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual methods for vertex and facet enumeration / 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: Variational methods in partially ordered spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality theory for set-valued functions. I: Fenchel conjugation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for Set-Valued Measures of Risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-valued risk measures for conical market models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solutions of set-valued optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution concepts in vector optimization: a fresh look at an old story / rank
 
Normal rank
Property / cites work
 
Property / cites work: New order relations in set optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Optimization with Infimum and Supremum / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to duality in vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the nondominated set of an MOLP by approximately solving its dual problem / rank
 
Normal rank

Latest revision as of 09:53, 6 July 2024

scientific article; zbMATH DE number 6156378
Language Label Description Also known as
English
An algorithm to solve polyhedral convex set optimization problems
scientific article; zbMATH DE number 6156378

    Statements

    An algorithm to solve polyhedral convex set optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    22 April 2013
    0 references
    set-valued optimization
    0 references
    set relation
    0 references
    set criterion
    0 references
    vector optimization
    0 references
    infimum attainment
    0 references

    Identifiers