Algorithms for linearly constrained problems under (1) separables program (2) Wolfe's reduced gradient method (3) Convex simplex method
Material type:
TextSeries: MT 330 Mathematics ProjectPublication details: Dar es Salaam : University of Dar es Salaam, 1997.Description: ii,43p. ; 30cmSubject(s): LOC classification: - MATH RES QA9.58.M39
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| Theses & Dissertation | Directorate of Library Services (UDSM) | Mathematics Department | MATH RES QA9.58.M39 (Browse shelf(Opens below)) | Not for loan | 000000202445 |
Browsing Directorate of Library Services (UDSM) shelves, Collection: Mathematics Department Close shelf browser (Hides shelf browser)
|
|
|
No cover image available No cover image available | No cover image available No cover image available | No cover image available No cover image available | No cover image available No cover image available | ||
| MATH RES QA5.M3713 Encyclopaedia of mathematics | MATH RES QA5.M3713 Encyclopaedia of mathematics. | MATH RES QA5.M3713 Encyclopaedia of mathematics. | MATH RES QA9.58.M39 Algorithms for linearly constrained problems under (1) separables program (2) Wolfe's reduced gradient method (3) Convex simplex method | MATH RES QA9.58.N53 Shortest path algorithm | MATH RES QA74.N44 Institute: computer corporation of Tanzania Ltd (CCTL), Dar es Salaam | MATH RES QA76.6.K54 Algebraic interpreter |
Includes bibliographical references
There are no comments on this title.
Log in to your account to post a comment.