A primal simplex approach to a special class of generalized networks /
allocation problems. Simply, this kind of problem can be
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1997.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | allocation problems. Simply, this kind of problem can be binary flows, which are usually obtained by a branch and bound methodology, this thesis focuses only on the linear defined as that of selecting one option, either in-house engineers or private contractors, for each project in order from the modified and general algorithms for a collection of manpower. Although the solution of the problem requires optimal solution. This conclusion is based on a comparison programming relaxation of the problem. The modified network significantly reduce computational time before identifying an simplex algorithm selects a more efficient initial basis to sixteen problems having from 5 to 315 projects each. specialization of the simplex algorithm to fit the network structure of a special class of engineering project The objective of this thesis is to modify a network to maximize benefits without exceeding available funds and |
|---|---|
| Item Description: | "Major subject: Industrial Engineering". Vita. |
| Physical Description: | viii, 79 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references: pages 42-45. |