Algorithms for nonlinear integer bicriterion problems

P. K. Eswaran; A. Ravindran; H. Moskowitz

doi:10.1007/BF00939577

Algorithms for nonlinear integer bicriterion problems

P. K. Eswaran, A. Ravindran, H. Moskowitz

Harold and Inge Marcus Department of Industrial and Manufacturing Engineering

Research output: Contribution to journal › Article › peer-review

32 Scopus citations

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	https://doi.org/10.1007/BF00939577
State	Published - Nov 1 1989

All Science Journal Classification (ASJC) codes

Control and Optimization
Management Science and Operations Research
Applied Mathematics

Access to Document

10.1007/BF00939577

Cite this

@article{f8d289d4e54c47028de34c464e5d4dfb,

title = "Algorithms for nonlinear integer bicriterion problems",

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.",

author = "Eswaran, \{P. K.\} and A. Ravindran and H. Moskowitz",

year = "1989",

month = nov,

day = "1",

doi = "10.1007/BF00939577",

language = "English (US)",

volume = "63",

pages = "261--279",

journal = "Journal of Optimization Theory and Applications",

issn = "0022-3239",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Algorithms for nonlinear integer bicriterion problems

AU - Eswaran, P. K.

AU - Ravindran, A.

AU - Moskowitz, H.

PY - 1989/11/1

Y1 - 1989/11/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0024771263

UR - https://www.scopus.com/inward/citedby.url?scp=0024771263&partnerID=8YFLogxK

U2 - 10.1007/BF00939577

DO - 10.1007/BF00939577

M3 - Article

AN - SCOPUS:0024771263

SN - 0022-3239

VL - 63

SP - 261

EP - 279

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

IS - 2

ER -

Algorithms for nonlinear integer bicriterion problems

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this