| DOI | Resolve DOI: https://doi.org/10.1080/00207727808941743 |
|---|
| Author | Search for: Abdelmalek, Nabih N.1 |
|---|
| Affiliation | - National Research Council of Canada
|
|---|
| Format | Text, Article |
|---|
| Abstract | In this paper the minimum time problem and the minimum fuel problem for discrete linear admissible control systems arc formulated (is one linear programming problem with two different objective functions. It is found that the obtained problem is very similar to the dual form of the linear programming problem for the discrete linear L1 approximation problem. An efficient dual simplex algorithm for the latter problem is used with the necessary modification* to obtain the solution of either of the former problems. Numerical results show that the present, method compares favourably with other known methods. |
|---|
| Publication date | 1978 |
|---|
| In | |
|---|
| Language | English |
|---|
| Peer reviewed | Yes |
|---|
| NRC number | NRCC 17195 |
|---|
| NPARC number | 21273631 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | b3e89d23-c718-4a52-bfcb-af555bb886c1 |
|---|
| Record created | 2015-01-16 |
|---|
| Record modified | 2020-03-13 |
|---|
