Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology (Q2204444)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7261602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology |
scientific article; zbMATH DE number 7261602 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8593401312828064
0 references
0.7246830463409424
0 references
0.7116865515708923
0 references
0.7097926139831543
0 references
0.7066712975502014
0 references
