Screen LibraryProceedings of the Princeton symposium on mathematical programming /
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 un...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Authors: | |
| Published: |
Princeton University Press,
|
| Publisher Address: | Princeton, N.J. : |
| Publication Dates: |
[2015] ©2015 |
| Literature type: | eBook |
| Language: | English |
| Subjects: | |
| Online Access: |
http://dx.doi.org/10.1515/9781400869930 http://www.degruyter.com/doc/cover/9781400869930.jpg |
| Summary: |
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 paperback editions preserve the original texts of these important books while presenting them in durable paperback 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. |
| Carrier Form: | 1 online resource(628pages) : illustrations |
| ISBN: | 9781400869930 |
| Index Number: | QA402 |
| CLC: | O221 |
| Contents: |
A THEORETICAL ANALYSIS OF INPUTS TAXATION UNDER LINEAR PROGRAMMING ASSUMPTIONS / ON THE SOLUTION OF STRUCTURED LP PROBLEMS USING GENERALIZED INVERSED METHODS / A METHOD FOR CONVEX PROGRAMMING / CONTINUOUS MATHEMATICAL PROGRAMMING UNDER LINEAR INTEGRAL CONSTRAINTS / RECENT DEVELOPMENTS I GEOMETRIC PROGRAMMING / NONCONVEX AND CONVEX PROGRAMMING BY GENERALIZED SEQUENTIAL UNCONSTRAINED METHODS / MATHEMATICAL PROGRAMMING BY PHYSICAL ANALOGIES / THE MAX-FLOW MIN-CUT EQUALITY AND THE LENGTH-WIDTH INEQUALITY FOR REAL MATRICES / IMPLICIT ENUMERATION USING AN IMBEDDED LINEAR PROGRAM / A PRINCIPAL PIVOTING ALGORITHM FOR LINEAR AND QUADRATIC PROGRAMS / ON THE KUHN-TUCKER THEORY / PROGRAMMING IN INFINITE DIMENSIONAL SPACE AND CONTROL THEORY / A FUNCTIONAL APPROACH TO THE DESIGN AND DEVELOPMENT OF A MATHEMATICAL PROGRAMMING SYSTEM / MAGEN II / A PARTICULAR CLASS OF FINITE-TIME MARKOV-RENEWAL PROGRAMMING SITUATIONS / A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK / THE DEGREE-CONSTRAINED SUBGRAPH PROBLEM / MATHEMATICAL PROGRAMMING AND PROJECT INTERRELATIONSHIPS IN CAPITAL BUDGETING / OPTIMUM DESIGN OF LONG PIPE LINE NETWORKS FOR GASES USING LINEAR PROGRAMMING / CENTRALIZATION AND DECENTRALIZATION OF DECISION MAKING - THE DOUBLE DECOMPOSITION METHOD - GENERALIZATION AND PROOF OF CONVERGENCE / NONLINEAR PROGRAMMING AND ENGINEERING DESIGN / NONLINEAR PROGRAMMING VIA ROTATIONAL DISCRIMINATION / COMPLEMENTARY SOLUTION Frontmatter -- PREFACE -- CONTENTS -- TWO METHODS OF DECOMPOSITION FOR LINEAR PROGRAMMING / MATRIX GENERATORS AND OUTPUT ANALYZERS / DECOMPOSITION APPROACHES FOR SOLVING LINKED PROGRAMS / LARGE SCALE SYSTEMS AND THE COMPUTER REVOLUTION / STOCHASTIC GEOMETRIC PROGRAMMING / THE CURRENT STATE OF CHANCE-CONSTRAINED PROGRAMMING / ON PROBABILISTIC CONSTRAINED PROGRAMMING / STOCHASTIC PROGRAMS WITH RECOURSE: SPECIAL FORMS / NONLINEAR ACTIVITY ANALYSIS AND DUALITY / DUALITY IN DISCRETE PROGRAMMING / INTEGER PROGRAMMING: METHODS, USES, COMPUTATION / ON RECENT DEVELOPMENTS IN INTEGER PROGRAMMING / ON MAXIMUM MATCHING, MINIMUM COVERING AND THEIR CONNECTIONS / PROGRAMMES MATHETIQUES NONLINEARES A VARIABLES BIVALENTES / ENUMERATION ALGORITHMS FOR THE PURE AND MIXED INTEGER PROGRAMMING PROBLEM / ON NEWTON S METHOD IN NONLINEAR PROGRAMMING / EXTENDING NEWTON'S METHOD TO SYSTEMS OF LINEAR INEQUALITIES / INTERIOR POINT METHODS FOR THE SOLUTION OF MATHEMATICAL PROGRAMMING PROBLEMS / THE SOLUTION OF A FIXED CHARGE LINEAR PROGRAMMING PROBLEM / ON CLASSES OF CONVEX AND PREEMPTIVE NUCLEI FOR N-PERSON GAMES / WHEN IS A TEAM "MATHEMATICALLY" ELIMINATED? / ON THE EXISTENCE OF OPTIMAL DEVELOPMENT PLANS / OPTIMALITY AND DUALITY IN NONLINEAR PROGRAMMING / GEOMETRIC PROGRAMMING: DUALITY IN QUADRATIC PROGRAMMING AND l / CONJUGATE CONVEX FUNCTIONS IN NONLINEAR PROGRAMMING / A COMPARATIVE STUDY OF NONLINEAR PROGRAMMING COD |