Skip to main content
Log in

On characterizing the “knee” of the Pareto curve based on Normal-Boundary Intersection

  • Research Papers
  • Published:
Structural optimization Aims and scope Submit manuscript

Abstract

This paper deals with the issue of generating one Pareto optimal point that is guaranteed to be in a “desirable” part of the Pareto set in a given multicriteria optimization problem. A parameterization of the Pareto set based on the recently developed normal-boundary intersection technique is used to formulate a subproblem, the solution of which yields the point of “maximum bulge”, often referred to as the “knee of the Pareto curve”. This enables the identification of the “good region” of the Pareto set by solving one nonlinear programming problem, thereby bypassing the need to generate many Pareto points. Further, this representation extends the concept of the “knee” for problems with more than two objectives. It is further proved that this knee is invariant with respect to the scales of the multiple objective functions.

The generation of this knee however requires the value of each objective function at the minimizer of every objective function (the pay-off matrix). The paper characterizes situations when approximations to the function values comprising the pay-off matrix would suffice in generating a good approximation to the knee. Numerical results are provided to illustrate this point. Further, a weighted sum minimization problem is developed based on the information in the pay-off matrix, by solving which the knee can be obtained.

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

Access this article

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

  • Cohon, J. 1978:Multiobjective programming and planning. New York: Academic Press

    Google Scholar 

  • Das, I. 1997:Nonlinear multicriteria optimization and robust optimality. Ph.D. Thesis, Department of Computational & Applied Mathematics, Rice University, Houston, TX

    Google Scholar 

  • Das, I.; Dennis, J.E. 1997: A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems.Struct. Optim. 14, 63–69

    Google Scholar 

  • Das, I.; Dennis, J.E. 1998: Normal-boundary intersection: an new method for generating the Pareto surface in multicriteria optimization problems.SIAM J. Optimiz. 8, 631–657

    Google Scholar 

  • Ignizio, J.P. 1976:Goal programming and extensions. Lexington, MA

  • Koski, J.: 1988: Multicriteria truss optimization. In: Stadler, W. (ed.)Multicriterai optimization in engineering and in the sciences. New York: Plenum Press

    Google Scholar 

  • Lee, S.M. 1972:Goal programming for decision analysis. Philadelphia: Auerbach Publ.

    Google Scholar 

  • Lin, J.G. 1975: Three methods for determing Pareto-optimal solutions of multiple-objective problems. In: Ho, Y.C.; Mitter S.K. (eds.)Directions in large-scale systems, pp. 117–138. New York: Plenum Press

    Google Scholar 

  • Romero, C. 1991:Handbook of critical issues in goal programming. Oxford: Pergamon

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Das, I. On characterizing the “knee” of the Pareto curve based on Normal-Boundary Intersection. Structural Optimization 18, 107–115 (1999). https://doi.org/10.1007/BF01195985

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01195985

Keywords

Navigation