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 is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kuhn, H. W., andTucker, A. W.,Nonlinear Programming, Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics, Edited by J. Neyman, University of California Press, Berkeley, California, pp. 481–492, 1951.
Geoffrion, A. M.,Solving Bicriterion Mathematical Programs, Operations Research, Vol. 15, pp. 39–54, 1967.
Fishburn, P. C.,Utility Theory for Decision Making, Wiley, New York, New York, 1970.
Keeney, R. L., andRaiffa, H.,Decision with Multiple Objectives: Preferences and Value Tradeoffs, Wiley, New York, New York, 1976.
Zionts, S.,A Multiple Criteria Method for Choosing among Discrete Alternatives, European Journal of Operational Research, Vol. 7, pp. 143–147, 1981.
Marcotte, O., andSoland, R. M.,A General Interactive Branch-and-Bound Algorithm for MCDM, Paper Presented at the ORSA/TIMS Meeting, San Diego, California, 1982.
Villarreal, B., andKarwan, M. H.,Multicriteria Integer Programming: A (Hybrid) Dynamic Programming Recursive Approach, Mathematical Programming, Vol. 21, pp. 204–223, 1981.
Simopoulos, A. K.,Multicriteria Integer 0–1 Programming: A Tree Search Type Algorithm, US Naval Postgraduate School, MS Thesis, 1977.
Bitran, G. R.,Linear Multiple Objective Programs with 0–1 Variables, Mathematical Programming, Vol. 13, pp. 121–139, 1977.
Bitran, G. R.,Theory and Algorithms for Linear Multiple Objective Programs with 0–1 Variables, Mathematical Programming, Vol. 17, pp. 362–390, 1979.
Klein, D., andHannan, E.,An Algorithm for the Multiple Objective Integer Linear Programming Problem, European Journal of Operational Research, Vol. 9, pp. 378–385, 1982.
Moskowitz, H., Ravindran, A., Klein, G., andEswaran, P. K.,A Bicriterion Model for Acceptance Sampling, Optimization in Statistics, Edited by S. H. Zanakis and J. S. Rustagi, North-Holland, New York, New York, Vol. 19, pp. 305–322, 1982.
Bowman, V. J. Jr.,On the Relationship of Techebycheff Norm and the Efficient Frontier of Multiple-Criteria Objectives, Notes in Economics and Mathematical Systems, Vol. 130, pp. 76–85, 1975.
Steuer, R. E., andChoo, E. V.,An Interactive Weighted Tchebycheff Procedure for Multiple Objective Programming, Working Paper No. 81-109, College of Business Administration, University of Georgia, Athens, Georgia, 1981.
Eswaran, P. K.,Interactive Decision Making Involving Integer Bicriterion Problems—Algorithms and Applications, Purdue University, PhD Thesis, 1983.
Sadagopan, S., andRavindran, A.,Interactive Solution of Bicriteria Mathematical Programs, Naval Research Logistics Quarterly, Vol. 29, pp. 443–459, 1982.
Author information
Authors and Affiliations
Additional information
Communicated by C. T. Leondes
This research was supported by the National Science Foundation Grant No. ECS-82-12076 with the University of Oklahoma.
Rights and permissions
About this article
Cite this article
Eswaran, P.K., Ravindran, A. & Moskowitz, H. Algorithms for nonlinear integer bicriterion problems. J Optim Theory Appl 63, 261–279 (1989). https://doi.org/10.1007/BF00939577
Issue Date:
DOI: https://doi.org/10.1007/BF00939577