Proceedings of the Princeton Symposium on Mathematical Programming

*Frontmatter, pg. i*PREFACE, pg. iii*CONTENTS, pg. iv*TWO METHODS OF DECOMPOSITION FOR LINEAR PROGRAMMING, pg. 1*MATRIX GENERATORS AND OUTPUT ANALYZERS, pg. 25*DECOMPOSITION APPROACHES FOR SOLVING LINKED PROGRAMS, pg. 37*LARGE SCALE SYSTEMS AND THE COMPUTER REVOLUTION, pg. 51*STOCHASTIC GEOMETRIC PROGRAMMING, pg. 73*THE CURRENT STATE OF CHANCE-CONSTRAINED PROGRAMMING, pg. 93*ON PROBABILISTIC CONSTRAINED PROGRAMMING, pg. 113*STOCHASTIC PROGRAMS WITH RECOURSE: SPECIAL FORMS, pg. 139*NONLINEAR ACTIVITY ANALYSIS AND DUALITY, pg. 163*DUALITY IN DISCRETE PROGRAMMING, pg. 179*INTEGER PROGRAMMING: METHODS, USES, COMPUTATION, pg. 199*ON RECENT DEVELOPMENTS IN INTEGER PROGRAMMING, pg. 267*ON MAXIMUM MATCHING, MINIMUM COVERING AND THEIR CONNECTIONS, pg. 303*PROGRAMMES MATHETIQUES NONLINEARES A VARIABLES BIVALENTES, pg. 313*ENUMERATION ALGORITHMS FOR THE PURE AND MIXED INTEGER PROGRAMMING PROBLEM, pg. 323*ON NEWTON'S METHOD IN NONLINEAR PROGRAMMING, pg. 339*EXTENDING NEWTON'S METHOD TO SYSTEMS OF LINEAR INEQUALITIES, pg. 353*INTERIOR POINT METHODS FOR THE SOLUTION OF MATHEMATICAL PROGRAMMING PROBLEMS, pg. 359*THE SOLUTION OF A FIXED CHARGE LINEAR PROGRAMMING PROBLEM, pg. 367*ON CLASSES OF CONVEX AND PREEMPTIVE NUCLEI FOR N-PERSON GAMES, pg. 377*WHEN IS A TEAM "MATHEMATICALLY" ELIMINATED?, pg. 391*ON THE EXISTENCE OF OPTIMAL DEVELOPMENT PLANS, pg. 403*OPTIMALITY AND DUALITY IN NONLINEAR PROGRAMMING, pg. 429*GEOMETRIC PROGRAMMING: DUALITY IN QUADRATIC PROGRAMMING AND lp -APPROXIMATION I, pg. 445*CONJUGATE CONVEX FUNCTIONS IN NONLINEAR PROGRAMMING, pg. 481*A COMPARATIVE STUDY OF NONLINEAR PROGRAMMING CODES, pg. 487*MINIMIZATION OF A SEPARABLE FUNCTION SUBJECT TO LINEAR CONSTRAINTS, pg. 503*DIRECT HYPERCONE UNCONSTRAINED MINIMIZATION, pg. 511*NONLINEAR PROGRAMMING AND SECOND VARIATION SCHEMES IN CONSTRAINED OPTIMAL CONTROL PROBLEMS, pg. 523*ON CONTINUOUS FINITE-DIMENSIONAL CONSTRAINED OPTIMIZATION, pg. 539*QUADRATIC FORMS SEMI-DEFINITE OVER CONVEX CONES, pg. 551*APPLICATIONS OF PRINCIPAL PIVOTING, pg. 567*LEAST DISTANCE PROGRAMMING, pg. 583*MAXIMIZING STATIONARY UTILITY IN A CONSTANT TECHNOLOGY, pg. 591*OPTIMUM ROUTING IN CONNECTING NETWORKS OVER FINITE TIME INTERVALS, pg. 591*SECOND ORDER CHARACTERIZATION OF GENERALIZED POLYNOMIAL PROGRAMS, pg. 591*ORTHOGONALITY IN MATROIDS AND MATHEMATICAL PROGRAMMING, pg. 592*A THEORETICAL ANALYSIS OF INPUTS TAXATION UNDER LINEAR PROGRAMMING ASSUMPTIONS, pg. 592*ON THE SOLUTION OF STRUCTURED LP PROBLEMS USING GENERALIZED INVERSED METHODS, pg. 593*A METHOD FOR CONVEX PROGRAMMING, pg. 594*CONTINUOUS MATHEMATICAL PROGRAMMING UNDER LINEAR INTEGRAL CONSTRAINTS, pg. 594*RECENT DEVELOPMENTS INU GEOMETRIC PROGRAMMING, pg. 595*NONCONVEX AND CONVEX PROGRAMMING BY GENERALIZED SEQUENTIAL UNCONSTRAINED METHODS, pg. 595*MATHEMATICAL PROGRAMMING BY PHYSICAL ANALOGIES, pg. 595*THE MAX-FLOW MIN-CUT EQUALITY AND THE LENGTH-WIDTH INEQUALITY FOR REAL MATRICES, pg. 596*IMPLICIT ENUMERATION USING AN IMBEDDED LINEAR PROGRAM, pg. 596*A PRINCIPAL PIVOTING ALGORITHM FOR LINEAR AND QUADRATIC PROGRAMS, pg. 597*ON THE KUHN-TUCKER THEORY, pg. 597*PROGRAMMING IN INFINITE DIMENSIONAL SPACE AND CONTROL THEORY, pg. 599*A FUNCTIONAL APPROACH TO THE DESIGN AND DEVELOPMENT OF A MATHEMATICAL PROGRAMMING SYSTEM, pg. 600*MAGEN II, pg. 600*A PARTICULAR CLASS OF FINITE-TIME MARKOV-RENEWAL PROGRAMMING SITUATIONS, pg. 601*A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK, pg. 601*THE DEGREE-CONSTRAINED SUBGRAPH PROBLEM, pg. 601*MATHEMATICAL PROGRAMMING AND PROJECT INTERRELATIONSHIPS IN CAPITAL BUDGETING, pg. 602*OPTIMUM DESIGN OF LONG PIPE LINE NETWORKS FOR GASES USING LINEAR PROGRAMMING, pg. 603*CENTRALIZATION AND DECENTRALIZATION OF DECISION MAKING - THE DOUBLE DECOMPOSITION METHOD - GENERALIZATION AND PROOF OF CONVERGENCE, pg. 603*NONLINEAR PROGRAMMING AND ENGINEERING DESIGN, pg. 605*NONLINEAR PROGRAMMING VIA ROTATIONAL DISCRIMINATION, pg. 606*COMPLEMENTARY SOLUTIONS FOR SYSTEMS OF LINEAR EQUATIONS, pg. 607*ON THE COMPLEXITY OF DISCRETE PROGRAMMING PROBLEMS, pg. 608*ILL-CONDITIONING OCCURRING IN PENALTY AND BARRIER FUNCTIONS, pg. 608*THE SHIFTING-OBJECTIVE ALGORITHM: AN ALTERNATIVE METHOD FOR SOLVING GENERAL LINEAR PROGRAMMING PROBLEMS, pg. 609*THE BLOCK PRODUCT DECOMPOSITION ALGORITHM, pg. 610*ITERATIVE SOLUTION OF LARGE, SPARSE LINEAR SYSTEMS AND RELATED TOPICS, pg. 611*APPROXIMATE COMPUTATIONAL SOLUTION OF NONLINEAR PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS BY LINEAR PROGRAMMING, pg. 612*THE SHRINKING BOUNDARY ALGORITHM FOR DIOPHANTINE PROGRAMMING, pg. 612*APPLICATION OF NONLINEAR PROGRAMMING AND BAYESIAN STATISTICS TO THE THEORY OF THE FIRM, pg. 613*AN ALGORITHM FOR LINEARLY CONSTRAINED NONLINEAR ESTIMATION WITH EXTENSIONS TO GENERAL NONLINEAR PROGRAMMING, pg. 613*ALGORITHMS FOR MINIMAL TREES AND SEMI-STEINER TREES BASED ON THE SIMPLEX METHOD, pg. 614*APPLICATION OF LINEAR AND NONLINEAR PROGRAMMING IN OPTIMAL CONTROL OF NUCLEAR REACTORS, pg. 615*A NEW ALGORITHM FOR TRANSPORTATION AND ASSIGNMENT PROBLEMS, pg. 616*THE SOLUTION OF PROGRAMMING PROBLEMS BY GENERATING FUNCTIONS, pg. 616*ON SOLVING SOME CLASSES OF INTEGER LINEAR PROGRAMMING PROBLEMS, pg. 616*AN EXTENDED DUALITY THEOREM FOR CONTINUOUS LINEAR PROGRAMMING PROBLEMS, pg. 617*THE GUIDING PERMUTATION METHOD FOR COMBINATORIAL PROBLEMS, pg. 617*MINIMIZING A CONVEX FUNCTION OVER A CONVEX HULL, pg. 618*GAMES, LINEAR PROGRAMMING AND THE TCHEBYCHEFF APPROXIMATION, pg. 619*ON A PRIMAL INTEGER PROGRAMMING ALGORITHM, pg. 619*APPLICATIONS OF THE CONVERGENCE CONDITIONS, pg. 620