OnlineWoerterBuecher.de
Internes

Lexikon


linear programming


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)

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 - (2329 Reads)

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

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