Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver (Q5198001): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129195065, #quickstatements; #temporary_batch_1723839584858
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962737507 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1801.10584 / 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: State Constraints in Convex Control Problems of Bolza / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undergraduate Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polyhedral projection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem / 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: Vector Optimization with Infimum and Supremum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Duality in Multiple Objective Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vector linear program solver Bensolve -- notes on theoretical background / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129195065 / rank
 
Normal rank

Latest revision as of 21:26, 16 August 2024

scientific article; zbMATH DE number 7111803
Language Label Description Also known as
English
Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver
scientific article; zbMATH DE number 7111803

    Statements

    Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 October 2019
    0 references
    polyhedron
    0 references
    polyhedral set
    0 references
    polyhedral convex analysis
    0 references
    polyhedron computations
    0 references
    multiple objective linear programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers