|
|||||
|
|
Algorithms for nonlinear integer bicriterion problems |
|
| Authors: | P K Eswaran A Ravindran H Moskowitz |
| Institution: | (1) Department of Management Systems, Ohio University, Athens, Ohio;(2) School of Industrial Engineering, University of Oklahoma, Norman, Oklahoma;(3) Krannert Graduate School of Management, Purdue University, West Lafayette, Indiana |
| 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.This research was supported by the National Science Foundation Grant No. ECS-82-12076 with the University of Oklahoma. |
| Keywords: | Bicriteria optimization integer programming Tchebycheff norm quality control interactive methods |
| 本文献已被 SpringerLink 等数据库收录！ | |