Chapters in this book

1. Frontmatter i
2. PREFACE iii
3. CONTENTS iv
4. PART I. LARGE SCALE SYSTEMS
5. TWO METHODS OF DECOMPOSITION FOR LINEAR PROGRAMMING 1
6. MATRIX GENERATORS AND OUTPUT ANALYZERS 25
7. DECOMPOSITION APPROACHES FOR SOLVING LINKED PROGRAMS 37
8. LARGE SCALE SYSTEMS AND THE COMPUTER REVOLUTION 51
9. PART II. PROGRAMMING UNDER UNCERTAINTY
10. STOCHASTIC GEOMETRIC PROGRAMMING 73
11. THE CURRENT STATE OF CHANCE-CONSTRAINED PROGRAMMING 93
12. ON PROBABILISTIC CONSTRAINED PROGRAMMING 113
13. STOCHASTIC PROGRAMS WITH RECOURSE: SPECIAL FORMS 139
14. NONLINEAR ACTIVITY ANALYSIS AND DUALITY 163
15. PART III. INTEGER PROGRAMMING
16. DUALITY IN DISCRETE PROGRAMMING 179
17. INTEGER PROGRAMMING: METHODS, USES, COMPUTATION 199
18. ON RECENT DEVELOPMENTS IN INTEGER PROGRAMMING 267
19. ON MAXIMUM MATCHING, MINIMUM COVERING AND THEIR CONNECTIONS 303
20. PROGRAMMES MATHETIQUES NONLINEARES A VARIABLES BIVALENTES 313
21. ENUMERATION ALGORITHMS FOR THE PURE AND MIXED INTEGER PROGRAMMING PROBLEM 323
22. PART IV. ALGORITHMS
23. ON NEWTON’S METHOD IN NONLINEAR PROGRAMMING 339
24. EXTENDING NEWTON'S METHOD TO SYSTEMS OF LINEAR INEQUALITIES 353
25. INTERIOR POINT METHODS FOR THE SOLUTION OF MATHEMATICAL PROGRAMMING PROBLEMS 359
26. PART V. APPLICATIONS
27. THE SOLUTION OF A FIXED CHARGE LINEAR PROGRAMMING PROBLEM 367
28. ON CLASSES OF CONVEX AND PREEMPTIVE NUCLEI FOR N-PERSON GAMES 377
29. WHEN IS A TEAM ”MATHEMATICALLY“ ELIMINATED? 391
30. ON THE EXISTENCE OF OPTIMAL DEVELOPMENT PLANS 403
31. OPTIMALITY AND DUALITY IN NONLINEAR PROGRAMMING 429
32. GEOMETRIC PROGRAMMING: DUALITY IN QUADRATIC PROGRAMMING AND l_p -APPROXIMATION I 445
33. CONJUGATE CONVEX FUNCTIONS IN NONLINEAR PROGRAMMING 481
34. PART VII. NONLINEAR PROGRAMMING
35. A COMPARATIVE STUDY OF NONLINEAR PROGRAMMING CODES 487
36. MINIMIZATION OF A SEPARABLE FUNCTION SUBJECT TO LINEAR CONSTRAINTS 503
37. DIRECT HYPERCONE UNCONSTRAINED MINIMIZATION 511
38. NONLINEAR PROGRAMMING AND SECOND VARIATION SCHEMES IN CONSTRAINED OPTIMAL CONTROL PROBLEMS 523
39. ON CONTINUOUS FINITE-DIMENSIONAL CONSTRAINED OPTIMIZATION 539
40. PART VIII. PIVOTAL METHODS
41. QUADRATIC FORMS SEMI-DEFINITE OVER CONVEX CONES 551
42. APPLICATIONS OF PRINCIPAL PIVOTING 567
43. LEAST DISTANCE PROGRAMMING 583
44. PART IX. ABSTRACTS
45. MAXIMIZING STATIONARY UTILITY IN A CONSTANT TECHNOLOGY 591
46. OPTIMUM ROUTING IN CONNECTING NETWORKS OVER FINITE TIME INTERVALS 591
47. SECOND ORDER CHARACTERIZATION OF GENERALIZED POLYNOMIAL PROGRAMS 591
48. ORTHOGONALITY IN MATROIDS AND MATHEMATICAL PROGRAMMING 592
49. A THEORETICAL ANALYSIS OF INPUTS TAXATION UNDER LINEAR PROGRAMMING ASSUMPTIONS 592
50. ON THE SOLUTION OF STRUCTURED LP PROBLEMS USING GENERALIZED INVERSED METHODS 593
51. A METHOD FOR CONVEX PROGRAMMING 594
52. CONTINUOUS MATHEMATICAL PROGRAMMING UNDER LINEAR INTEGRAL CONSTRAINTS 594
53. RECENT DEVELOPMENTS IΝ GEOMETRIC PROGRAMMING 595
54. NONCONVEX AND CONVEX PROGRAMMING BY GENERALIZED SEQUENTIAL UNCONSTRAINED METHODS 595
55. MATHEMATICAL PROGRAMMING BY PHYSICAL ANALOGIES 595
56. THE MAX-FLOW MIN-CUT EQUALITY AND THE LENGTH-WIDTH INEQUALITY FOR REAL MATRICES 596
57. IMPLICIT ENUMERATION USING AN IMBEDDED LINEAR PROGRAM 596
58. A PRINCIPAL PIVOTING ALGORITHM FOR LINEAR AND QUADRATIC PROGRAMS 597
59. ON THE KUHN-TUCKER THEORY 597
60. PROGRAMMING IN INFINITE DIMENSIONAL SPACE AND CONTROL THEORY 599
61. A FUNCTIONAL APPROACH TO THE DESIGN AND DEVELOPMENT OF A MATHEMATICAL PROGRAMMING SYSTEM 600
62. MAGEN II 600
63. A PARTICULAR CLASS OF FINITE-TIME MARKOV-RENEWAL PROGRAMMING SITUATIONS 601
64. A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK 601
65. THE DEGREE-CONSTRAINED SUBGRAPH PROBLEM 601
66. MATHEMATICAL PROGRAMMING AND PROJECT INTERRELATIONSHIPS IN CAPITAL BUDGETING 602
67. OPTIMUM DESIGN OF LONG PIPE LINE NETWORKS FOR GASES USING LINEAR PROGRAMMING 603
68. CENTRALIZATION AND DECENTRALIZATION OF DECISION MAKING - THE DOUBLE DECOMPOSITION METHOD - GENERALIZATION AND PROOF OF CONVERGENCE 603
69. NONLINEAR PROGRAMMING AND ENGINEERING DESIGN 605
70. NONLINEAR PROGRAMMING VIA ROTATIONAL DISCRIMINATION 606
71. COMPLEMENTARY SOLUTIONS FOR SYSTEMS OF LINEAR EQUATIONS 607
72. ON THE COMPLEXITY OF DISCRETE PROGRAMMING PROBLEMS 608
73. ILL-CONDITIONING OCCURRING IN PENALTY AND BARRIER FUNCTIONS 608
74. THE SHIFTING-OBJECTIVE ALGORITHM: AN ALTERNATIVE METHOD FOR SOLVING GENERAL LINEAR PROGRAMMING PROBLEMS 609
75. THE BLOCK PRODUCT DECOMPOSITION ALGORITHM 610
76. ITERATIVE SOLUTION OF LARGE, SPARSE LINEAR SYSTEMS AND RELATED TOPICS 611
77. APPROXIMATE COMPUTATIONAL SOLUTION OF NONLINEAR PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS BY LINEAR PROGRAMMING 612
78. THE SHRINKING BOUNDARY ALGORITHM FOR DIOPHANTINE PROGRAMMING 612
79. APPLICATION OF NONLINEAR PROGRAMMING AND BAYESIAN STATISTICS TO THE THEORY OF THE FIRM 613
80. AN ALGORITHM FOR LINEARLY CONSTRAINED NONLINEAR ESTIMATION WITH EXTENSIONS TO GENERAL NONLINEAR PROGRAMMING 613
81. ALGORITHMS FOR MINIMAL TREES AND SEMI-STEINER TREES BASED ON THE SIMPLEX METHOD 614
82. APPLICATION OF LINEAR AND NONLINEAR PROGRAMMING IN OPTIMAL CONTROL OF NUCLEAR REACTORS 615
83. A NEW ALGORITHM FOR TRANSPORTATION AND ASSIGNMENT PROBLEMS 616
84. THE SOLUTION OF PROGRAMMING PROBLEMS BY GENERATING FUNCTIONS 616
85. ON SOLVING SOME CLASSES OF INTEGER LINEAR PROGRAMMING PROBLEMS 616
86. AN EXTENDED DUALITY THEOREM FOR CONTINUOUS LINEAR PROGRAMMING PROBLEMS 617
87. THE GUIDING PERMUTATION METHOD FOR COMBINATORIAL PROBLEMS 617
88. MINIMIZING A CONVEX FUNCTION OVER A CONVEX HULL 618
89. GAMES, LINEAR PROGRAMMING AND THE TCHEBYCHEFF APPROXIMATION 619
90. ON A PRIMAL INTEGER PROGRAMMING ALGORITHM 619
91. APPLICATIONS OF THE CONVERGENCE CONDITIONS 620