Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology (Q2204444): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:37, 2 February 2024
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
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
