Proceedings of the Princeton Symposium on Mathematical Programming
1st Edition
Published on 19. May 2015
628 pages
978-1-4008-6993-0 (ISBN)
Description
This volume contains thirty-three selected general research papers devoted to the theory and application of the mathematics of constrained optimization, including linear programming and its extensions to convex programming, general nonlinear programming, integer programming, and programming under uncertainty.
Originally published in 1971.
The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
Originally published in 1971.
The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
More details
Other editions
Additional editions
Book
04/2016
Princeton University Press
€269.60
Article not available at the moment
Book
03/2015
Princeton University Press
€92.50
Article not available at the moment
Book
02/1971
Princeton University Press
€92.85
Article exhausted; check different version
Person
Harold William Kuhn
Content
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 MATH
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 MATH
