Algorithms for nonlinear integer bicriterion problems (Q1114597)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for nonlinear integer bicriterion problems |
scientific article; zbMATH DE number 4083388
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for nonlinear integer bicriterion problems |
scientific article; zbMATH DE number 4083388 |
Statements
Algorithms for nonlinear integer bicriterion problems (English)
0 references
1989
0 references
Two algorithms to solve the nonlinear bicriterion integer mathematical programming (BIMP) problem are presented. One is a noninteractive procedure that generates the entire efficient set, and the second one is an interactive procedure that determines the best compromise solution of the decision maker (DM). A Tchebysheff norm related approach is used for generating the efficient points for the BIMP problem. An application of the interactive procedure for a quality control problem is also presented.
0 references
nonlinear bicriterion integer mathematical programming
0 references
efficient set
0 references
best compromise solution
0 references
Tchebycheff norm related approach
0 references
interactive procedure
0 references
quality control
0 references
0.93027216
0 references
0.91534674
0 references
0.91534674
0 references
0 references
0 references
0.90986454
0 references
0.90948653
0 references
