Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology (Q2204444)

From MaRDI portal
Revision as of 11:19, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
scientific article

    Statements

    Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 October 2020
    0 references
    multi-objective optimization
    0 references
    lexicographic optimization
    0 references
    mixed integer linear programming
    0 references
    numerical infinitesimals
    0 references
    grossone methodology
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers