Skip to main content
SpringerLink
Log in

Efficiency and Solution Approaches to Bicriteria Nonconvex Programs

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

A new nonlinear scalarization specially designed for bicriteria nonconvexprogramming problems is presented. The scalarization is based on generalizedLagrangian duality theory and uses an augmented Lagrange function. The newconcepts, q i-approachable points and augmented duality gap, are introducedin order to determine the location of nondominated solutions with respect to aduality gap as well as the connectedness of the nondominated set.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aksoy, Y., An Interactive Branch and Bound Algorithm for Bicriterion Nonconvex/Mixed Integer Programming, Naval Research Logistics 37, pp. 403–417, 1990.

    Google Scholar 

  • Ashton, D.J. and D.R. Atkins, Multicriteria Programming for Financial Planning: Some Second Thoughts, in Multiple Criteria Analysis–Operational Methods, Peter Nijkamp and Jaap Spronk (eds.), Gower Publishing Company Limited, Aldershot, Hampshire, England, pp. 11–23, 1981.

    Google Scholar 

  • Bazaraa, M.S., Geometry and Resolution of Duality Gaps, Naval Research Logistics Quarterly 20, pp. 357–366, 1973.

    Google Scholar 

  • Benson, H.P., Existence of Efficient Solutions for Vector Maximization Problems, Journal of Optimization Theory and Applications 26, pp. 569–580, 1978.

    Google Scholar 

  • Benson, H.P., Vector Maximization with Two Objective Functions, Journal of Optimization Theory and Applications 28, pp. 253–257, 1979.

    Google Scholar 

  • Benson, H.P. and T.L. Morin, The Vector Maximization Problem: Proper Efficiency and Stability, SIAM Journal on Applied Mathematics 32, pp. 64–72, 1977.

    Google Scholar 

  • Benson, H.P, and T. L. Morin, Bicriteria Mathematical Programming Model for Nutrition Planning in Developing Nations, Management Science 33, pp. 11593–11601, 1987.

    Google Scholar 

  • Bernau, H., Use of Exact Penalty Functions to Determine Efficient Decisions, European Journal of Operational Research 49, pp. 348–355, 1990.

    Google Scholar 

  • Cambini, A., and L. Martein, Linear Fractional and Bicriteria Linear Fractional Programs, Generalized Convexity and Fractional Programming with Economic Application, A. Cambini, E. Castagnoli, L. Martein, P. Mazzoleni, and S. Schaible (eds.), Springer-Verlag, Berlin, pp. 155–166, 1988.

    Google Scholar 

  • Choo, E.U. and D.R. Atkins, Bicriteria Linear Fractional Programming, Journal of Optimization Theory and Applications 36, pp. 203–220, 1982.

    Google Scholar 

  • Eschenauer, H., J. Koski, and A. Osyczka, Multicriteria Design Optimization—Procedures and Applications, Springer-Verlag, Berlin, 1990.

    Google Scholar 

  • Gaughan, E.D., Introduction to Analysis, Wadsworth Publishing Company, Inc., 1975.

  • Gearhart, W.B., Technical Note: On the Characterization of Pareto-Optimal Solutions in Bicriterion Optimization, Journal of Optimization Theory and Applications 7, pp. 301–307, 1979.

    Google Scholar 

  • Geoffrion, A.M., Solving Bicriterion Mathematical Programs, Operations Research 15, pp. 39–54, 1967.

    Google Scholar 

  • Gould, F.J., Extensions of LagrangeMultipliers in Nonlinear Programming, SIAMJournal of Applied Mathematics 17, pp. 1280–1297, 1969.

    Google Scholar 

  • Haimes, Y.Y. and V. Chankong, Multiobjective Decision Making—Theory and Methodology, North Holland, New York, 1983.

    Google Scholar 

  • Helbig, S., On a Constructive Approximation of the Efficient Outcomes in Bicriterion Vector Optimization, Journal of Optimization Theory and Applications 78, pp. 613–622, 1993.

    Google Scholar 

  • Jahn, J. and A. Merkel, Reference Point Approximation Method for the Solution of Bicriteria Nonlinear Optimization Problems, Journal of Optimization Theory and Application 4, pp. 87–103, 1992.

    Google Scholar 

  • Jahn, J., J. Klose and A. Merkel, On the Application of a Method of Reference Point Approximation to Bicriterial Optimization Problems in Chemical Engineering, Advances in Optimization, W. Oettli and D. Pallaschke (eds.), Springer-Verlag, Berlin, pp. 478–491, 1992.

    Google Scholar 

  • Jueschke, A., J. Jahn and A. Kirsch, A Bicriterial Optimization Problem of Antenna Design, to appear in Computational Optimization and Applications.

  • Kaliszewski, I., Norm Scalarization and Proper Efficiency in Vector Optimization, Foundations of Control Engineering 11, pp. 117–131, 1986.

    Google Scholar 

  • Kopsidas, G.C., Multiobjective Optimization of Table Olive Preparation Systems, European Journal of Operations Research 85, pp. 383–398, 1995.

    Google Scholar 

  • Kostreva, M.M., T. Ordoyne, and M. Wiecek, Multiple-objective Programming with Polynomial Objectives and Constraints, European Journal of Operational Research 57, pp. 381–394, 1992.

    Google Scholar 

  • Ku Chi-Fa, Some Applications of Multiple Objective Decision Making, in Operational Research ’81, J.P. Brans (ed.), North-Holland, Amsterdam, pp. 395–404, 1981.

    Google Scholar 

  • Lee, S.M. and A.J. Wynne, Separable Goal Programming, in Multiple Criteria Analysis–Operational Methods, Peter Nijkamp and Jaap Spronk (eds.), Gower Publishing Company Limited, Aldershot, Hampshire, England, pp. 117–136, 1981.

    Google Scholar 

  • Luc, D.T., Connectedness of the Efficient Point Sets in Quasiconcave Vector Maximization, Journal of Mathematical Analysis and Applications 122, pp. 346–354, 1987.

    Google Scholar 

  • Martein, L., On the Bicriteria Maximization Problem, Generalized Convexity and Fractional Programming with Economic Application, A. Cambini, E. Castagnoli, L. Martein, P. Mazzoleni, and S. Schaible (eds.), Springer-Verlag, Berlin, pp. 14–22, 1988.

    Google Scholar 

  • Minoux, M., Mathematical Programming–Theory and Algorithms, John Wiley, Chichester, 1986.

    Google Scholar 

  • Naccache, P.H., Connectedness of the Set of Nondominated Outcomes inMulticriteria Optimization, Journal of Optimization Theory and Applications 25, pp. 459–467, 1978.

    Google Scholar 

  • Nakayama, H., H. Sayama, and Y. Sawaragi, A Generalized Lagrangian Function and Multiplier Method, Journal of Optimization Theory and Aplications 17, pp. 211–227, 1975.

    Google Scholar 

  • Osyczka, A., Multicriterion Optimization in Engineering with Fortran Programs, Ellis Horwood, Chichester, 1984.

    Google Scholar 

  • Osyczka, A. and J. Zajac, Multicriteria Optimization of Computationally Expensive Functions and its Application to Robot Spring Balancing Mechanism Design, Multicriteria Design Optimization–Procedures and Applications, H.A. Eschenauer, J. Koski, and A. Osyczka (eds.), Springer-Verlag, Berlin, pp. 168–183, 1990.

    Google Scholar 

  • Pareto, V., Cours d’Economie Politique, Rouge, Lausanne, Switzerland, 1896.

  • Payne, H.J., E. Polak, D.C. Collins, and W.S. Meisel, An Algorithm for Bicriteria Optimization Based on the Sensitivity Function, IEEE Transactions on Automatic Control, AC-20, pp. 546–548, 1975.

    Google Scholar 

  • Payne A.N., and E. Polak, An Interactive Rectangle Elimination Method for Bi-Objective Decision Making, IEEE Transactions on Automatic Control, AC-25, pp. 421–432, 1980.

    Google Scholar 

  • Payne, A.N., Efficient Approximate Representation of Bi-Objective Tradeoff Sets, Journal of the Franklin Institute 330, pp. 1219–1233, 1993.

    Google Scholar 

  • Rietveld, P., Multiple Objective Decision Methods and Regional Planning, North Holland, Amsterdam, 1980.

    Google Scholar 

  • Rockafellar, R.T., Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming, SIAM Journal on Control 12, pp. 268–285, 1974.

    Google Scholar 

  • Roy, A. and J. Wallenius, Nonlinear Multiple Objective Optimization: An Algorithm and Some Theory, Faculty working paper DIS 85–86, College of Business, Arizona StateUniversity, Tempe, AZ, 1988.

    Google Scholar 

  • Schaible, S., Bicriteria Quasiconcave Programs, Cahiers du Centre d’Etudes de Recherche Operationnelle 25, pp. 93–101, 1983.

    Google Scholar 

  • Steuer, R.E. and E.U. Choo, An Interactive Weighted Tchebycheff Procedure for Multiple Objective Programming, Mathematical Programming 26pp. 309–322, 1983.

    Google Scholar 

  • Tabek, D, A.A. Schy, D.P. Giesy and K.G. Johnson, Application of Multiobjective Optimization in Aircraft Control Systems Design. Automatica 15, pp. 595–600, 1979.

    Google Scholar 

  • TenHuisen, M.L., Generalized Lagrangian Duality inMultiple Objective Programming, Ph.D. thesis, Clemson University, Clemson, S.C., 1993.

  • TenHuisen, M.L. and M.M. Wiecek, A New Approach to Solving Multicriteria Nonconvex Optimization Problems, Support Systems for Decision and Negotiation Processes, R. Kulikowski, Z. Nahorski, J.W. Owsinski, and A. Straszak (eds.), System Research Institute Polish Academy of Sciences, Warsaw, 1992.

    Google Scholar 

  • TenHuisen, M.L. and M.M. Wiecek, Vector Optimization and Generalized Lagrangian Duality, Annals of Operations Research 51, pp. 15–32, 1994.

    Google Scholar 

  • TenHuisen, M.L. and M.M. Wiecek, On the Structure of the Nondominated Set for Bicriteria Programs, to appear in Multi-Criteria Decision Analysis, 1996.

  • Tind, J. and L.A. Wolsey, An Elemementary Survey of General Duality Theory in Mathematical Programming, Mathematical Programming 21, pp. 241–261, 1981.

    Google Scholar 

  • Walker, J., An Interactive Method As an Aid in Solving Bicriterion Mathematical Programming Problems, Journal of the Operational Research Society 29, pp. 915–922, 1978.

    Google Scholar 

  • Warburton, A.R., Quasiconcave Vector Maximization: Connectedness of the Sets of Pareto-optimal and Weak Pareto-optimal Alternatives, Journal of Optimization Theory and Applications 40, pp. 537–557, 1983.

    Google Scholar 

  • Warburton, A.R. Parametric Solution of Bicriterion Linear Fractional Programs, Operations Research 33, pp. 74–84, 1985.

    Google Scholar 

  • Wendell, R.E., and D.N. Lee, Efficiency inMultiple Objective Optimization Problems, Mathematical Programming 12, pp. 406–414, 1977.

    Google Scholar 

  • Wierzbicki, A.P., The Use of Reference Objectives in Multiobjective Optimization, Multiple Criteria Decision Making Theory and Applications, G. Fandel and T. Gal (eds.), Springer Verlag, Berlin, pp. 468–486, 1980.

    Google Scholar 

  • Wierzbicki, A.P., On the Completeness and Constructiveness of Parametric Characterizations to Vector Optimization Problems, OR-Spektrum 8, pp. 73–87, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Sciences Department, The University of North Carolina at Wilmington, Wilmington, NC, U.S.A

    Matthew L. TENHUISEN

  2. Department of Mathematical Sciences, Clemson University, Clemson, SC, U.S.A

    Malgorzata M. Wiecek

Authors
  1. Matthew L. TENHUISEN
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Malgorzata M. Wiecek
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

TENHUISEN, M.L., Wiecek, M.M. Efficiency and Solution Approaches to Bicriteria Nonconvex Programs. Journal of Global Optimization 11, 225–251 (1997). https://doi.org/10.1023/A:1008270131268

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008270131268

Search

Navigation