Abstract
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 Tchebycheff 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.
Original language | English (US) |
---|---|
Pages (from-to) | 261-279 |
Number of pages | 19 |
Journal | Journal of Optimization Theory and Applications |
Volume | 63 |
Issue number | 2 |
DOIs | |
State | Published - Nov 1 1989 |
All Science Journal Classification (ASJC) codes
- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics