ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Nelineární metoda Best Worst Method×Nelineární programování×
OborRozhodováníOptimalizace
RodinaMCDMProcess / pipeline
Rok vzniku20162006
TvůrceExtended development of Rezaei's BWM frameworkJorge Nocedal & Stephen Wright
TypNon-linear optimization for flexible weight derivationContinuous mathematical optimization
Původní zdrojRezaei, J. (2015). Best-worst multi-criteria decision-making method: Some properties and a linear model. Journal of Cleaner Production, 229, 976-985. DOI ↗Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1
Další názvyNon-linear BWM, Nonlinear BWMNLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama
Příbuzné33
ShrnutíNon-linear BWM is a variant of the Best Worst Method that replaces the linear programming formulation with non-linear optimization. Instead of minimizing the maximum deviation (Chebyshev distance), it minimizes the sum of squared deviations (L2 norm). This provides more flexible weight derivation and better accommodates uncertain or fuzzy preferences.Nonlinear programming (NLP) is a branch of mathematical optimization concerned with problems in which the objective function or at least one constraint is nonlinear. Formalized comprehensively by Jorge Nocedal and Stephen Wright in their seminal 2006 text, NLP encompasses gradient-based algorithms — including sequential quadratic programming (SQP), interior-point methods, and quasi-Newton approaches — for finding locally or globally optimal solutions to continuous decision problems arising across engineering, economics, and the physical sciences.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Non-linear Best Worst Method · Nonlinear Programming. Získáno 2026-06-15 z https://scholargate.app/cs/compare