Upangaji wa Upimaji (QP)
Upangaji wa Upimaji (QP) ni darasa la utatuzi wa hisabati wenye vikwazo ambapo kipengele cha lengo ni cha upimaji na vikwazo ni vya mstari. Umeandaliwa rasmi na Frank na Wolfe (1956) kupitia algorithm yao ya mwelekeo unaokubalika kulingana na mteremko, QP ni msingi katika utafiti wa shughuli, fedha, ujifunzaji wa mashine, na usanifu wa uhandisi popote ambapo mtu lazima apunguze gharama ya upimaji yenye umbo la bakuli (au isiyo na umbo la bakuli) chini ya masharti ya kukubalika kwa mstari.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Frank, M., & Wolfe, P. (1956). An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3(1–2), 95–110. DOI: 10.1002/nav.3800030109 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 2). Quadratic Programming (QP). ScholarGate. https://scholargate.app/sw/optimization/quadratic-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Uboreshaji MbonyeoUboreshaji↔ compare
- Usanifu wa MipangoUboreshaji↔ compare
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →