|
1. |
Allocation of a resource to alternative probabilistic demands: Transport‐equipment pool assignments |
|
Naval Research Logistics Quarterly,
Volume 6,
Issue 3,
1959,
Page 193-207
Rubin Saposnik,
Vernon L. Smith,
A. R. Lindeman,
Preview
|
PDF (740KB)
|
|
ISSN:0028-1441
DOI:10.1002/nav.3800060302
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1959
数据来源: WILEY
|
2. |
An inventory policy for repair parts |
|
Naval Research Logistics Quarterly,
Volume 6,
Issue 3,
1959,
Page 209-220
Martin J. Beckmann,
Preview
|
PDF (437KB)
|
|
ISSN:0028-1441
DOI:10.1002/nav.3800060303
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1959
数据来源: WILEY
|
3. |
A simplified two‐phase technique for the simplex method |
|
Naval Research Logistics Quarterly,
Volume 6,
Issue 3,
1959,
Page 221-226
George F. Hadley,
Michael A. Simonnard,
Preview
|
PDF (283KB)
|
|
摘要:
AbstractA simplified two‐phase technique is presented for treating artificial vectors when simplex calculations are made by hand. This procedure allows the elimination of the extra row used to keep artificial variables at a zero level in Phase II, when they appear at a zero level in the basis at the end of Phase
ISSN:0028-1441
DOI:10.1002/nav.3800060304
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1959
数据来源: WILEY
|
4. |
On quadratic proramming |
|
Naval Research Logistics Quarterly,
Volume 6,
Issue 3,
1959,
Page 227-243
E. M. L. Beale,
Preview
|
PDF (748KB)
|
|
摘要:
AbstractThe algorithm for quadratic programming given by Beale [1] is described in detail. Some extensions of the algorithm are indicated, and the relationship between this algorithm and that given by Wolfe [5]is discussed briefly.
ISSN:0028-1441
DOI:10.1002/nav.3800060305
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1959
数据来源: WILEY
|
5. |
A theorem in convex programming |
|
Naval Research Logistics Quarterly,
Volume 6,
Issue 3,
1959,
Page 245-260
William Karush,
Preview
|
PDF (558KB)
|
|
摘要:
AbstractAn optimization problem which frequently arises in applications of mathematical programming is the following:Where fiare convex functions. In this paper, the function F is studied and shown to satisfy F(A, B) = M (A) + N(B), where M and N are increasing and decreasing convex functions, respectively. Also, the functional equation F (A, C) = F(A, B) + F(B, C) − F(B, B) is established. These results generalize to the continuous caseF(A, B)=min ∫ OTf(t, x(t))dt, with x(t) increasing and A ≤ x (0) ≤ x (T) ≤ B. The results obtained in this paper are useful for reducing an optimization problem with many variables to one with fewe
ISSN:0028-1441
DOI:10.1002/nav.3800060306
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1959
数据来源: WILEY
|
6. |
Notes |
|
Naval Research Logistics Quarterly,
Volume 6,
Issue 3,
1959,
Page 261-262
Preview
|
PDF (133KB)
|
|
ISSN:0028-1441
DOI:10.1002/nav.3800060307
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1959
数据来源: WILEY
|
7. |
Recent publications |
|
Naval Research Logistics Quarterly,
Volume 6,
Issue 3,
1959,
Page 263-264
Preview
|
PDF (101KB)
|
|
ISSN:0028-1441
DOI:10.1002/nav.3800060308
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1959
数据来源: WILEY
|
8. |
Masthead |
|
Naval Research Logistics Quarterly,
Volume 6,
Issue 3,
1959,
Page -
Preview
|
PDF (62KB)
|
|
ISSN:0028-1441
DOI:10.1002/nav.3800060301
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1959
数据来源: WILEY
|
|