Skip to main content
Top
Published in: OR Spectrum 4/2016

01-10-2016 | Regular Article

Quadratic scalarization for decomposed multiobjective optimization

Authors: Brian Dandurand, Margaret M. Wiecek

Published in: OR Spectrum | Issue 4/2016

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Practical applications in multidisciplinary engineering design, business management, and military planning require distributed solution approaches for solving nonconvex, multiobjective optimization problems (MOPs). Under this motivation, a quadratic scalarization method (QSM) is developed with the goal to preserve decomposable structures of the MOP while addressing nonconvexity in a manner that avoids a high degree of nonlinearity and the introduction of additional nonsmoothness. Under certain assumptions, necessary and sufficient conditions for QSM-generated solutions to be weakly and properly efficient for an MOP are developed, with any form of efficiency being understood in a local sense. QSM is shown to correspond with the relaxed, reformulated weighted-Chebyshev method as a special case. An example is provided for demonstrating the application of QSM to a nonconvex MOP.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Benson H (1978) Existence of efficient solutions for vector maximization problems. J Optimiz Theory Appl 26(4):569–580CrossRef Benson H (1978) Existence of efficient solutions for vector maximization problems. J Optimiz Theory Appl 26(4):569–580CrossRef
go back to reference Benson H (1979) An improved definition of proper efficiency for vector maximization with respect to cones. J Math Anal Appl 71(1):232–241CrossRef Benson H (1979) An improved definition of proper efficiency for vector maximization with respect to cones. J Math Anal Appl 71(1):232–241CrossRef
go back to reference Bertsekas D (1982) Constrained optimization and Lagrange multiplier methods. Academic Press Bertsekas D (1982) Constrained optimization and Lagrange multiplier methods. Academic Press
go back to reference Bertsekas D (1999) Nonlinear programming. Athena Scientific Bertsekas D (1999) Nonlinear programming. Athena Scientific
go back to reference Boţ R, Grad SM, Wanka G (2009) Duality in vector optimization, 1st edn. Springer Publishing Company, USA Boţ R, Grad SM, Wanka G (2009) Duality in vector optimization, 1st edn. Springer Publishing Company, USA
go back to reference Bonettini S (2011) Inexact block coordinate descent methods with application to non-negative matrix factorization. IMA J Numer Anal 31(4):1431–1452 Bonettini S (2011) Inexact block coordinate descent methods with application to non-negative matrix factorization. IMA J Numer Anal 31(4):1431–1452
go back to reference Borwein J (1977) Proper efficient points for maximizations with respect to cones. SIAM J Control Optimiz 15(1):57–63CrossRef Borwein J (1977) Proper efficient points for maximizations with respect to cones. SIAM J Control Optimiz 15(1):57–63CrossRef
go back to reference Bowman VJ (1976) On the relationship of the Tchebycheff norm and the effcient frontier of multiple-criteria objectives. In: Thieriez H (ed) Multiple criteria decision making, vol 130., Lecture notes in economics and mathematical systems. Springer, Berlin, pp 76–85 Bowman VJ (1976) On the relationship of the Tchebycheff norm and the effcient frontier of multiple-criteria objectives. In: Thieriez H (ed) Multiple criteria decision making, vol 130., Lecture notes in economics and mathematical systems. Springer, Berlin, pp 76–85
go back to reference Burachik R, Kaya C, Rizvi M (2014) A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets. J Optimiz Theory Appl 162(2):428–446CrossRef Burachik R, Kaya C, Rizvi M (2014) A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets. J Optimiz Theory Appl 162(2):428–446CrossRef
go back to reference Chankong V, Haimes YY (1983) Multiobjective decision making theory and methodology. Elsevier Science, New York Chankong V, Haimes YY (1983) Multiobjective decision making theory and methodology. Elsevier Science, New York
go back to reference Charnes A, Cooper W (1961) Management models and industrial applications of linear programming. Wiley, New York Charnes A, Cooper W (1961) Management models and industrial applications of linear programming. Wiley, New York
go back to reference Dandurand B (2013) Mathematical optimization for engineering design problems. Ph.D. thesis, Clemson University Dandurand B (2013) Mathematical optimization for engineering design problems. Ph.D. thesis, Clemson University
go back to reference Dandurand B, Guarneri P, Fadel G, Wiecek MM (2014) Bilevel multiobjective packaging optimization for automotive design. Struct Multidisc Optimiz 50(4):663–682CrossRef Dandurand B, Guarneri P, Fadel G, Wiecek MM (2014) Bilevel multiobjective packaging optimization for automotive design. Struct Multidisc Optimiz 50(4):663–682CrossRef
go back to reference Dandurand B, Wiecek M (2015) Distributed computation of Pareto sets. SIAM J Optimiz 25(2):1083–1109CrossRef Dandurand B, Wiecek M (2015) Distributed computation of Pareto sets. SIAM J Optimiz 25(2):1083–1109CrossRef
go back to reference Drummond LMG, Svaiter BF (2005) A steepest descent method for vector optimization. J Comp Appl Math 175:395–414CrossRef Drummond LMG, Svaiter BF (2005) A steepest descent method for vector optimization. J Comp Appl Math 175:395–414CrossRef
go back to reference Ehrgott M (1998) Discrete decision problems, multiple criteria optimization classes and lexicographic max-ordering. In: TJ Stewart, RC van den Honert (eds) Trends in multicriteria decision making, lecture notes in economics and mathematical systems, vol. 465. Springer-Verlag Ehrgott M (1998) Discrete decision problems, multiple criteria optimization classes and lexicographic max-ordering. In: TJ Stewart, RC van den Honert (eds) Trends in multicriteria decision making, lecture notes in economics and mathematical systems, vol. 465. Springer-Verlag
go back to reference Ehrgott M (2005) Multicriteria optimization. Lecture notes in economics and mathematical systems, 2nd edn. Springer-Verlag, Berlin Ehrgott M (2005) Multicriteria optimization. Lecture notes in economics and mathematical systems, 2nd edn. Springer-Verlag, Berlin
go back to reference Ehrgott M, Wiecek M (2005) Multiobjective programming. In: Figueira J, Greco S, Ehrgott M (eds) Multiple criteria decision analysis: state of the art surveys. Springer, Boston, pp 667–722 Ehrgott M, Wiecek M (2005) Multiobjective programming. In: Figueira J, Greco S, Ehrgott M (eds) Multiple criteria decision analysis: state of the art surveys. Springer, Boston, pp 667–722
go back to reference Eichfelder G (2008) Adaptive scalarization methods in multiobjective optimization. Vector optimization. Springer-Verlag, BerlinCrossRef Eichfelder G (2008) Adaptive scalarization methods in multiobjective optimization. Vector optimization. Springer-Verlag, BerlinCrossRef
go back to reference Eichfelder G (2009) An adaptive scalarization method in multiobjective optimization. SIAM J Optimiz 19(4):1694–1718CrossRef Eichfelder G (2009) An adaptive scalarization method in multiobjective optimization. SIAM J Optimiz 19(4):1694–1718CrossRef
go back to reference Faulkenberg S, Wiecek M (2012) Generating equidistant representations in biobjective programming. Comp Optimiz Appl 51(3):1173–1210CrossRef Faulkenberg S, Wiecek M (2012) Generating equidistant representations in biobjective programming. Comp Optimiz Appl 51(3):1173–1210CrossRef
go back to reference Fliege J, Svaiter BF (2000) Steepest descent methods for multicriteria optimization. Math Methods Operat Res 51:479–494CrossRef Fliege J, Svaiter BF (2000) Steepest descent methods for multicriteria optimization. Math Methods Operat Res 51:479–494CrossRef
go back to reference Fliege J, Drummond LMG, Svaiter BF (2009) Newton’s method for multiobjective optimization. SIAM J Optimiz 20(2):602–626CrossRef Fliege J, Drummond LMG, Svaiter BF (2009) Newton’s method for multiobjective optimization. SIAM J Optimiz 20(2):602–626CrossRef
go back to reference Flores-Bazán F, Hernández E (2011) A unified vector optimization problem: complete scalarizations and applications. Optimization 60(12):1399–1419CrossRef Flores-Bazán F, Hernández E (2011) A unified vector optimization problem: complete scalarizations and applications. Optimization 60(12):1399–1419CrossRef
go back to reference Gale D (1960) The Theory of Linear Economic Models. McGraw-Hill Book Company Gale D (1960) The Theory of Linear Economic Models. McGraw-Hill Book Company
go back to reference Galperin EA (2004) Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization. Math Comp Model 40(7–8):847–859CrossRef Galperin EA (2004) Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization. Math Comp Model 40(7–8):847–859CrossRef
go back to reference Galperin EA, Wiecek MM (1999) Retrieval and use of the balance set in multiobjective global optimization. Comp Math Appl 37(4/5):111–123CrossRef Galperin EA, Wiecek MM (1999) Retrieval and use of the balance set in multiobjective global optimization. Comp Math Appl 37(4/5):111–123CrossRef
go back to reference Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. J Math Anal Appl 22:618–630CrossRef Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. J Math Anal Appl 22:618–630CrossRef
go back to reference Grippo L, Sciandrone M (2000) On the convergence of the block nonlinear Gauss–Seidel method under convex constraints. Operat Res Lett 26(3):127–136CrossRef Grippo L, Sciandrone M (2000) On the convergence of the block nonlinear Gauss–Seidel method under convex constraints. Operat Res Lett 26(3):127–136CrossRef
go back to reference Jilla C, Miller D (2004) Multi-objective, multidisciplinary design optimization methodology for distributed satellite systems. J Spacecraft Rockets 41(1):39–50CrossRef Jilla C, Miller D (2004) Multi-objective, multidisciplinary design optimization methodology for distributed satellite systems. J Spacecraft Rockets 41(1):39–50CrossRef
go back to reference Kaliszewski I (1987) A modified weighted Tchebycheff metric for multiple objective programming. Comp Operat Res 14(4):315–323CrossRef Kaliszewski I (1987) A modified weighted Tchebycheff metric for multiple objective programming. Comp Operat Res 14(4):315–323CrossRef
go back to reference Kasimbeyli R (2013) A conic scalarization method in multi-objective optimization. J Global Optimiz 56(2):279–297CrossRef Kasimbeyli R (2013) A conic scalarization method in multi-objective optimization. J Global Optimiz 56(2):279–297CrossRef
go back to reference Kogut P, Manzo R (2014) On quadratic scalarization of vector optimization problems in Banach spaces. Appl Anal 93(5):994–1009CrossRef Kogut P, Manzo R (2014) On quadratic scalarization of vector optimization problems in Banach spaces. Appl Anal 93(5):994–1009CrossRef
go back to reference Kuhn HW, Tucker AW (1951) Nonlinear programming. In: Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. University of California Press, Berkeley, Calif pp. 481–492 Kuhn HW, Tucker AW (1951) Nonlinear programming. In: Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. University of California Press, Berkeley, Calif pp. 481–492
go back to reference Li D (1996) Convexification of a noninferior frontier. J Optimiz Theory Appl 88:177–196CrossRef Li D (1996) Convexification of a noninferior frontier. J Optimiz Theory Appl 88:177–196CrossRef
go back to reference Makinen R, Periaux J, Toivanen J (1999) Multidisciplinary shape optimization in aerodynamics and electromagnetics using genetic algorithms. Int J Numer Methods Fluids 30(2):149–159CrossRef Makinen R, Periaux J, Toivanen J (1999) Multidisciplinary shape optimization in aerodynamics and electromagnetics using genetic algorithms. Int J Numer Methods Fluids 30(2):149–159CrossRef
go back to reference Mangasarian O (1969) Nonlinear programming. McGraw-Hill Book Company Mangasarian O (1969) Nonlinear programming. McGraw-Hill Book Company
go back to reference Maplesoft: Maple 17. Maplesoft, a division of Waterloo Maple Inc., Waterloo, Ontario (2013) Maplesoft: Maple 17. Maplesoft, a division of Waterloo Maple Inc., Waterloo, Ontario (2013)
go back to reference Pareto V (1896) Manual d’économie politique. F. Rouge, Lausanne Pareto V (1896) Manual d’économie politique. F. Rouge, Lausanne
go back to reference Pascoletti A, Serafini P (1984) Scalarizing vector optimization problems. J Optimiz Theory Appl 42(4):499–524CrossRef Pascoletti A, Serafini P (1984) Scalarizing vector optimization problems. J Optimiz Theory Appl 42(4):499–524CrossRef
go back to reference Peri D, Campana E (2003) Multidisciplinary design optimization of a naval surface combatant. J Ship Res 47(1):1–12 Peri D, Campana E (2003) Multidisciplinary design optimization of a naval surface combatant. J Ship Res 47(1):1–12
go back to reference Rastegar N, Khorram E (2014) A combined scalarizing method for multiobjective programming problems. Euro J Operat Res 236(1):229–237CrossRef Rastegar N, Khorram E (2014) A combined scalarizing method for multiobjective programming problems. Euro J Operat Res 236(1):229–237CrossRef
go back to reference Rockafellar R (1974) Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J Control 12:268–285CrossRef Rockafellar R (1974) Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J Control 12:268–285CrossRef
go back to reference Ruszczyński A (2006) Nonlinear optimization. Princeton University Press Ruszczyński A (2006) Nonlinear optimization. Princeton University Press
go back to reference Schütze O, Witting K, Ober-Blöbaum S, Dellnitz M (2013) Set oriented methods for the numerical treatment of multiobjective optimization problems. In: E Tantar, AA Tantar, P Bouvry, P Del Moral, P Legrand, CA Coello Coello, O Schütze (eds) EVOLVE: a bridge between probability, set oriented numerics and evolutionary computation. Studies in computational intelligence vol. 447. Springer, Berlin Heidelberg pp. 187–219 Schütze O, Witting K, Ober-Blöbaum S, Dellnitz M (2013) Set oriented methods for the numerical treatment of multiobjective optimization problems. In: E Tantar, AA Tantar, P Bouvry, P Del Moral, P Legrand, CA Coello Coello, O Schütze (eds) EVOLVE: a bridge between probability, set oriented numerics and evolutionary computation. Studies in computational intelligence vol. 447. Springer, Berlin Heidelberg pp. 187–219
go back to reference Steuer RE (1985) Multiple criteria optimization: theory computation and application. Wiley, New York Steuer RE (1985) Multiple criteria optimization: theory computation and application. Wiley, New York
go back to reference Steuer RE, Choo EU (1983) An interactive weighted Tchebycheff procedure for multiple objective programming. Math Program 26(3):326–344CrossRef Steuer RE, Choo EU (1983) An interactive weighted Tchebycheff procedure for multiple objective programming. Math Program 26(3):326–344CrossRef
go back to reference Tind J, Wiecek MM (1999) Augmented Lagrangian and Tchebycheff approaches in multiple objective programming. J Global Optimiz 14:251–266CrossRef Tind J, Wiecek MM (1999) Augmented Lagrangian and Tchebycheff approaches in multiple objective programming. J Global Optimiz 14:251–266CrossRef
go back to reference White DJ (1988) Weighting factor extensions for finite multiple objective vector minimization problems. Euro J Operat Res 36:256–265CrossRef White DJ (1988) Weighting factor extensions for finite multiple objective vector minimization problems. Euro J Operat Res 36:256–265CrossRef
go back to reference Yu PL (1973) A class of solutions for group decision making. Manag Sci 19:936–946CrossRef Yu PL (1973) A class of solutions for group decision making. Manag Sci 19:936–946CrossRef
go back to reference Zeleny M (1973) Compromise programming. In: JL Cochrane, M Zeleny (eds) Multiple criteria decision making pp. 262–301 Zeleny M (1973) Compromise programming. In: JL Cochrane, M Zeleny (eds) Multiple criteria decision making pp. 262–301
Metadata
Title
Quadratic scalarization for decomposed multiobjective optimization
Authors
Brian Dandurand
Margaret M. Wiecek
Publication date
01-10-2016
Publisher
Springer Berlin Heidelberg
Published in
OR Spectrum / Issue 4/2016
Print ISSN: 0171-6468
Electronic ISSN: 1436-6304
DOI
https://doi.org/10.1007/s00291-016-0453-z

Other articles of this Issue 4/2016

OR Spectrum 4/2016 Go to the issue