## Abstract A complete analysis and explicit solution is presented for the problem of linear fractional programming with interval programming constraints whose matrix is of full row rank. The analysis proceeds by simple transformation to canonical form, exploitation of the FarkasβMinkowki lemma and
An improved general Phase-I method in linear programming
β Scribed by Katharina Belling-Seib
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 386 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We describe an objective hyperplane search method for solving a class of integer linear programming (ILP) problems. We formulate the search as a bounded knapsack problem and develop requisite theory for formulating knapsack problems with composite constraints and composite objective functions that f
This paper deals with the problem of Stein-rule prediction in a general linear model. Our study extends the work of by assuming that the covariance matrix of the model's disturbances is unknown. Also, predictions are based on a composite target function that incorporates allowance for the simultane
The continual reassessment method (CRM) enables full and e$cient use of all data and prior information available in a phase I study. However, despite a number of recent enhancements to the method, its acceptance in actual clinical practice has been hampered by several practical di$culties. In this p