OnlineWoerterBuecher.de
Internes

Lexikon


linear programming


N> A procedure for fiNdiNg the maximum or miNimum of a liNear fuNctioN where the argumeNts are subject to liNear coNstraiNts. The simplex method is oNe well kNowN algorithm. (1995-04-06)

N="left">IN additioN suitable coNteNts:
[ = ] [ ai ] [ al ] [ algorithm ] [ am ] [ app ] [ applicatioN ] [ ar ] [ arc ] [ arg ] [ argumeNt ] [ at ] [ b ] [ bj ] [ ca ] [ cat ] [ ch ] [ co ] [ coN ] [ coNs ] [ coNstraiNt ] [ diNg ] [ du ] [ ec ] [ ed ] [ edu ] [ er ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ fuNctioN ] [ gu ] [ h ] [ hm ] [ hr ] [ id ] [ il ] [ iN ] [ iNt ] [ io ] [ is ] [ it ] [ kN ] [ Lex ] [ li ] [ liNe ] [ liNear fuNctioN ] [ ma ] [ method ] [ mo ] [ mod ] [ module ] [ mp ] [ mu ] [ Na ] [ Nc ] [ Ne ] [ Ng ] [ Ni ] [ No ] [ Ns ] [ ph ] [ pl ] [ pr ] [ procedure ] [ query ] [ rc ] [ re ] [ ro ] [ se ] [ si ] [ simplex ] [ simplex method ] [ st ] [ su ] [ subject ] [ T ] [ th ] [ to ] [ tr ] [ um ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2405 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0906 Seconds, with 16 Database-Queries
Zurück zur Startseite