## Content

### February 1986, Volume 11, Issue 1

**95-109 NBU Processes with General State Space***by*Albert W. Marshall & Moshe Shaked**110-116 Multivariate New Better than Used Distributions***by*Albert W. Marshall & Moshe Shaked**117-124 The Orthogonal Decomposition of Games and an Averaging Formula for the Shapley Value***by*Norman L. Kleinberg & Jeffrey H. Weiss**125-133 A Solvable One-Dimensional Model of a Diffusion Inventory System***by*Agnès Sulem**134-146 Explicit Solution of a Two-Dimensional Deterministic Inventory Problem***by*Agnès Sulem**147-160 On Repeated Games with Complete Information***by*Sylvain Sorin**161-168 On the Augmented Lagrangian***by*S.-P. Han**169-179 Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube***by*Robert M. Freund**180-183 Linear Programming for Finite State Multi-Armed Bandit Problems***by*Yih Ren Chen & Michael N. Katehakis**184-186 A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index***by*Lodewijk C. M. Kallenberg**187-191 Optimal Consecutive-2-Out-of- n Systems***by*D. Z. Du & F. K. Hwang

### November 1985, Volume 10, Issue 4

**527-542 Bounds and Heuristics for Capacitated Routing Problems***by*M. Haimovich & A. H. G. Rinnooy Kan**543-556 Extremal Splittings of Point Processes***by*Bruce Hajek**557-564 On Shortest Paths in Graphs with Random Weights***by*Refael Hassin & Eitan Zemel**565-575 Cores of Tangent Cones and Clarke's Tangent Cone***by*D. H. Martin & G. G. Watkins**576-584 Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates***by*C. N. Potts**585-598 Sequencing Problems in Two-Server Systems***by*A. R. Calderbank & E. G. Coffman & L. Flatto**599-611 Continuous-Time Red and Black: How to Control a Diffusion to a Goal***by*Victor C. Pestien & William D. Sudderth**612-618 A Note on Differentiability of Global Optimal Values***by*Okitsugu Fujiwara**619-632 Distributional Strategies for Games with Incomplete Information***by*Paul R. Milgrom & Robert J. Weber**633-641 Von Neumann-Morgenstern Utilities and Cardinal Preferences***by*Graciela Chichilnisky**642-649 Fixed Point Iterations and Global Stability in Economics***by*Lars Thorlund-Petersen**650-663 Strongly Stable Equilibrium Points of N -Person Noncooperative Games***by*M. Kojima & A. Okada & S. Shindoh**664-673 Continuity of Generalized Gradients and Multipliers Under Perturbations***by*Tullio Zolezzi**674-687 Generalized Cheney-Loeb-Dinkelbach-Type Algorithms***by*Jacob Flachs**688-700 The Ellipsoid Method Generates Dual Variables***by*Bruce P. Burrell & Michael J. Todd**701-708 A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees***by*James Roskind & Robert E. Tarjan**709-715 Optimal Sequential Selection of Secretaries***by*C. L. Mallows & V. N. Nair & L. A. Shepp & Y. Vardi

### August 1985, Volume 10, Issue 3

**367-378 The Partial Order of a Polymatroid Extreme Point***by*R. E. Bixby & W. H. Cunningham & D. M. Topkis**379-389 Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions***by*Alvin E. Roth**390-402 Semivalues of Political Economic Games***by*Abraham Neyman**403-438 Integral Polyhedra in Three Space***by*Herbert E. Scarf**439-449 Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm***by*Philip M. White & Andrew S. Caplin & Ludo van der Heyden**450-461 Existence of Overtaking Optimal Trajectories for Problems with Convex Integrands***by*Arie Leizarowitz**462-470 The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets***by*Mordechai I. Henig**471-497 Substitutes, Complements and Ripples in Network Flows***by*Frieda Granot & Arthur F. Veinott**498-514 A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set***by*H. Tuy & T. V. Thieu & Ng. Q. Thai**515-522 On the Solution of Variational Inequalities by the Ellipsoid Method***by*Hans-Jakob Lüthi**523-525 Cores of Convex Games Without Side Payments***by*Joseph Greenberg

### May 1985, Volume 10, Issue 2

**175-179 A Condition Number for Differentiable Convex Inequalities***by*O. L. Mangasarian**180-184 A Best Possible Heuristic for the k -Center Problem***by*Dorit S. Hochbaum & David B. Shmoys**185-194 A Linearization Algorithm for Nonsmooth Minimization***by*Krzysztof Czesław Kiwiel**195-206 Complementary Pivoting Algorithms Involving Extreme Rays***by*Roland Werner & Reinhard Wetzel**207-219 Second-Order Derivatives of Extremal-Value Functions and Optimality Conditions for Semi-Infinite Programs***by*Alexander Shapiro**220-232 On Bounds for Dynamic Programs***by*K.-H. Waldmann**233-243 Equivalent N -Person Games and the Null Space of the Shapley Value***by*Norman L. Kleinberg & Jeffrey H. Weiss**244-250 Discounted-Value Representations of Temporal Preferences***by*Jörgen W. Weibull**251-262 A Primal-Dual Algorithm for Submodular Flows***by*William H. Cunningham & András Frank**263-279 The Entropic Penalty Approach to Stochastic Programming***by*Aharon Ben-Tal**280-304 On a Class of Totally Unimodular Matrices***by*Mihalis Yannakakis**305-327 Asymptotic Analysis of the Time Dependent M/M/1 Queue***by*William A. Massey**328-339 Probabilistic Analysis of a Machine Scheduling Problem***by*Pedro G. Gazmuri**340-358 Facets of the Bipartite Subgraph Polytope***by*Francisco Barahona & Martin Grötschel & Ali Ridha Mahjoub**359-360 Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope***by*A. M. H. Gerards**361-366 Necessary Conditions for the Bolza Problem***by*Halina Frankowska

### February 1985, Volume 10, Issue 1

**1-6 The Space of Polynomials in Measures is Internal***by*Joshua Reichert & Yair Tauman**7-16 A Two-Resource Allocation Problem Solvable in Linear Time***by*Nimrod Megiddo & Tetsuo Ichimori**17-23 A 2-Person Game with Lack of Information on 1½ Sides***by*Sylvain Sorin & Shmuel Zamir**24-32 A Random Family of Queueing Systems with a Dynamic Priority Discipline***by*N. U. Prabhu & Paul K. Reeser**33-43 Segregating the Input to a Series of Buffers***by*F. P. Kelly**44-53 An Algorithm for the Equipollent Resource Allocation Problem***by*N. Katoh & T. Ibaraki & H. Mine**54-62 The Strong Positivity Conditions***by*Alfonso Reinoza**63-81 Average Optimal Singular Control and a Related Stopping Problem***by*M. I. Taksar**82-99 Nested Optimal Policies for Set Functions with Applications to Scheduling***by*Arjang A. Assad**100-116 Asymptotic Properties of the Quadratic Assignment Problem***by*J. B. G. Frenk & M. van Houweninge & A. H. G. Rinnooy Kan**117-153 Nonzero-Sum Two-Person Repeated Games with Incomplete Information***by*Sergiu Hart**154-157 Addendum: A Finite Algorithm for Solving Nonlinear Allocation Problems***by*John M. Einbu**158-159 The Mani-Walkup Spherical Counterexamples to the W v -Path Conjecture are Not Polytopal***by*Amos Altshuler**160-173 Markov Decision Drift Processes; Conditions for Optimality Obtained by Discretization***by*Arie Hordijk & Frank van der Duyn Schouten

### November 1984, Volume 9, Issue 4

**479-497 Variable Dimension Complexes Part I: Basic Theory***by*Robert M. Freund**498-509 Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology***by*Robert M. Freund**510-521 The Laguerre Transform and a Family of Functions with Nonnegative Laguerre Coefficients***by*Ushio Sumita**522-533 Thinning of Cluster Processes: Convergence of Sums of Thinned Point Processes***by*Richard Serfozo**534-544 Departures from a Queue with Many Busy Servers***by*Ward Whitt**545-557 Existence of Equilibrium on a Manifold***by*Norman Schofield**558-575 On the Existence of Average Optimal Policies in Semiregenerative Decision Models***by*Hans Deppe**576-591 A Minimax Theorem***by*L. McLinden**592-605 Iterative Optimization with Equality Constraints***by*J. Warga**606-614 Life Distribution Properties of Devices Subject to a Lévy Wear Process***by*Mohamed Abdel-Hameed**615-623 Optimal Repair Allocation in a Series System***by*Michael N. Katehakis & Cyrus Derman**624-628 A Light Traffic Approximation for a Single-Server Queue***by*D. J. Daley & T. Rolski**629-633 The Hirsch Conjecture for Dual Transportation Polyhedra***by*M. L. Balinski**634-634 Erratum***by*Ward Whitt

### August 1984, Volume 9, Issue 3

**319-344 Successive Approximation Methods for Solving Nested Functional Equations in Markov Decision Problems***by*Awi Federgruen & Paul J. Schweitzer**345-347 Axioms and Examples Related to Ordinal Dynamic Programming***by*Charles E. Blair**348-355 Convergence Rates for the Optimal Values of Allocation Processes***by*Zvi Artstein**356-362 A Matrix Game Solution of the Single-Controller Stochastic Game***by*Jerzy A. Filar & T. E. S. Raghavan**363-375 Equivalence of Surface Density and Average Directional Density***by*B. Curtis Eaves & James A. Yorke**376-383 Approximation Algorithms for the Assembly Line Crew Scheduling Problem***by*Wen-Lian Hsu**384-390 Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum***by*E. G. Coffman & M. Yannakakis**391-401 Conditions for the Existence of Planning Horizons***by*James C. Bean & Robert L. Smith**402-423 On the Imbalance of Inventories in Multi-Echelon Systems***by*Paul Zipkin**424-440 Storage Processes with Markov Additive Input and Output***by*Haya Kaspi**441-458 Open Queueing Networks in Heavy Traffic***by*Martin I. Reiman**459-470 Diffusion Approximations for Storage Processes with General Release Rules***by*Keigo Yamada**471-474 Vector Measures Are Open Maps***by*Dov Samet**475-477 Stochastic Dominance and Moment Inequalities***by*G. L. O'Brien

### May 1984, Volume 9, Issue 2

**159-189 Necessary Conditions in Nonsmooth Optimization***by*A. D. Ioffe**190-207 Minimum Convex Cost Dynamic Network Flows***by*James B. Orlin**208-221 On The Marginal Function in Nonlinear Programming***by*Bernhard Gollan**222-231 Duality and an Algorithm for a Class of Continuous Transportation Problems***by*E. J. Anderson & A. B. Philpott**232-243 A Finite Method for the Solution of a Multi-Resource Allocation Problem with Concave Return Functions***by*John M. Einbu**244-247 A Note on Approximation Schemes for Multidimensional Knapsack Problems***by*Michael J. Magazine & Maw-Sheng Chern**248-259 Single Machine Scheduling with Precedence Constraints of Dimension 2***by*George Steiner**260-266 A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors***by*E. G. Coffman & G. N. Frederickson & G. S. Lueker**267-275 A Unifying Note on Fatou's Lemma in Several Dimensions***by*E. J. Balder**276-289 Constrained Undiscounted Stochastic Dynamic Programming***by*A. Hordijk & L. C. M. Kallenberg**290-300 On Stationary Strategies in Countable State Total Reward Markov Decision Processes***by*Jan van der Wal**301-308 Dichotomous Search for Random Objects on an Interval***by*R. Hassin & M. Henig**309-316 On the Core and Dual Set of Linear Programming Games***by*Dov Samet & Eitan Zemel

### February 1984, Volume 9, Issue 1

**1-5 A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers***by*Egon Balas**6-24 Multiplicative Markov Decision Chains***by*Uriel G. Rothblum**25-42 An Application of the Aumann-Shapley Prices for Cost Allocation in Transportation Problems***by*Dov Samet & Yair Tauman & Israel Zang**43-65 On Random Binary Trees***by*Gerald G. Brown & Bruno O. Shubert**66-74 Diagonality of Cost Allocation Prices***by*Leonard J. Mirman & Abraham Neyman**75-86 A Newton-Type Algorithm for the Solution of the Implicit Programming Problem***by*C. D. Feinstein & S. S. Oren**87-111 Lipschitz Behavior of Solutions to Convex Minimization Problems***by*Jean-Pierre Aubin**112-141 Discretization and Weak Convergence in Markov Decision Drift Processes***by*Arie Hordijk & Frank A. van der Duyn Schouten**142-150 Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling***by*Richard Loulou**151-158 Life Lengths and Association: A Dynamic Approach***by*Elja Arjas & Ilkka Norros

### November 1983, Volume 8, Issue 4

**479-497 A Duality Theory for Infinite-Horizon Optimization of Concave Input/Ouput Processes***by*Joseph J. M. Evers**498-504 The Weighted Euclidean 1-Center Problem***by*Nimrod Megiddo**505-516 Preference Convex Unanimity in Multiple Criteria Decision Making***by*Gordon B. Hazen**517-524 A Fixed Point Approach to Certain Convex Programs with Applications in Stochastic Programming***by*Masao Fukushima**525-537 Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems***by*M. A. H. Dempster & M. L. Fisher & L. Jansen & B. J. Lageweg & J. K. Lenstra & A. H. G. Rinnooy Kan**538-548 Integer Programming with a Fixed Number of Variables***by*H. W. Lenstra**549-556 Constructing Majority Paths Between Arbitrary Points: General Methods of Solution for Quasi-Concave Preferences***by*Richard D. McKelvey**557-578 A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems***by*R. Saigal**579-589 On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets***by*D. Chinhyung Cho & Ellis L. Johnson & Manfred Padberg & M. R. Rao**590-612 On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems***by*D. Chinhyung Cho & Manfred W. Padberg & M. R. Rao**613-636 Optimal Consumption and Investment Policies Allowing Consumption Constraints and Bankruptcy***by*J. Lehoczky & S. Sethi & S. Shreve

### August 1983, Volume 8, Issue 3

**319-326 The Fair Division of a Fixed Supply Among a Growing Population***by*William Thomson**327-341 Approximate Purification of Mixed Strategies***by*R. J. Aumann & Y. Katznelson & R. Radner & R. W. Rosenthal & B. Weiss**342-365 Affine Structure and Invariant Policies for Dynamic Programs***by*Eric V. Denardo & Uriel G. Rothblum**366-372 Stationary Policies in Dynamic Programming Models Under Compactness Assumptions***by*Manfred Schäl**373-380 Optimal Control of the Diffusion Coefficient of a Simple Diffusion Process***by*J. M. McNamara**381-402 The Complexity of Vertex Enumeration Methods***by*M. E. Dyer**403-434 Adjoint Process Duality***by*J. M. Borwein**435-438 An Axiomatic Characterization of Multistate Coherent Structures***by*Wagner De Souza Borges & Flávio Wagner Rodrigues**439-453 Instantaneous Control of Brownian Motion***by*J. Michael Harrison & Michael I. Taksar**454-466 Impulse Control of Brownian Motion***by*J. Michael Harrison & Thomas M. Sellke & Allison J. Taylor**467-470 Proper Efficiency in Nonconvex Multicriteria Programming***by*E. U. Choo & D. R. Atkins**471-476 Polychromatic Acyclic Tours in Colored Multigraphs***by*Douglas H. Blair & Robert A. Pollak**477-477 Corrigendum: Algebraic Linear Programming***by*Alan Frieze**478-478 Erratum***by*E. J. Anderson & P. Nash & A. B. Philpott

### May 1983, Volume 8, Issue 2

**159-169 Preservation of Life Distribution Classes Under Reliability Operations***by*Ramón V. Lén & James Lynch**170-184 A Fast Algorithm for the Decomposition of Graphs and Posets***by*Hermann Buer & Rolf H. Möhring**185-195 A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions***by*Robert Mifflin**196-204 Nonconvexities in Univalence***by*W. I. Zangwill**205-214 A Unique Bargaining Solution Based on Competitive Commitments***by*Chal Sussangkarn**215-230 Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain***by*J. B. Rosen**231-259 Strong and Weak Convexity of Sets and Functions***by*Jean-Philippe Vial**260-272 An Algorithm for Solving the General Bilevel Programming Problem***by*Jonathan F. Bard**273-286 Jointly Constrained Biconvex Programming***by*Faiz A. Al-Khayyal & James E. Falk**287-297 Gambling Problems with a Limit Inferior Payoff***by*William D. Sudderth**298-313 Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards***by*A. Federgruen & P. J. Schweitzer & H. C. Tijms**314-314 Combinatorial Optimization with Rational Objective Functions: A Communication***by*R. K. Ahuja & J. L. Batra & S. K. Gupta**315-317 Complete Closedness of Maximal Monotone Operators***by*Liqun Qi

### February 1983, Volume 8, Issue 1

**1-14 On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees***by*D. S. Johnson & K. A. Niemi**15-25 A Light-Traffic Theorem for Multi-Server Queues***by*David Y. Burman & Donald R. Smith**26-33 Smoothed Functionals in Stochastic Optimization***by*R. Y. Rubinstein**34-41 Polarities Given by Systems of Bilinear Inequalities***by*Julián Aráoz D. & Jack Edmonds & Victor J. Griffin**42-63 Multi-Stage Planning and the Extended Linear-Quadratic-Gaussian Control Problem***by*J. C. Lagarias & F. Aminzadeh**64-73 On the Existence of Pareto Efficient Points***by*Jonathan M. Borwein**74-85 Extreme Points of Certain Sets of Probability Measures, with Applications***by*Alan F. Karr**86-99 Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level***by*G. van der Laan & A. J. J. Talman**100-109 An Algorithm for the Open-Shop Problem***by*Tibor Fiala**110-121 Team Guessing with Lacunary Information***by*H. S. Witsenhausen**122-134 Analysis of a Dynamic Duopoly Model of Advertising***by*Philip C. Jones**135-150 Convergence Rates of the Ellipsoid Method on General Convex Functions***by*Jean-Louis Goffin**151-157 Stimulating Prices in a Stochastic Model of Resource Allocation***by*D. P. Kennedy

### November 1982, Volume 7, Issue 4

**479-490 Inconsistencies of Weighted Summation Voting Systems***by*Donald G. Saari**491-500 Games with No Solutions and Empty Cores***by*W. F. Lucas & M. Rabie**501-514 A Class of Continuous Network Flow Problems***by*E. J. Anderson & P. Nash & A. B. Philpott**515-531 Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data***by*Gregory Dobson**532-544 Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems***by*James O. Achugbue & Francis Y. Chin**545-556 Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems***by*Daniel Granot & Frieda Granot & Ellis L. Johnson**557-567 Renewal Decisions when Category Life Distributions are of Phase-Type***by*David Assaf**568-581 Continuity Theorems in Stochastic Control Problems***by*Keigo Yamada**582-601 Growth Optimality for Branching Markov Decision Chains***by*Uriel G. Rothblum & Peter Whittle**602-616 Morse Programs: A Topological Approach to Smooth Constrained Optimization***by*Okitsugu Fujiwara**617-628 The Economics of Matching: Stability and Incentives***by*Alvin E. Roth**629-634 Moment-Preserving Shifts and Stochastic Dominance***by*Peter C. Fishburn**635-635 Erratum***by*E. L. Lawler & J. K. Lenstra & A. H. G. Rinnooy Kan

### August 1982, Volume 7, Issue 3

**319-333 On Hart Production Games***by*Shigeo Muto**334-347 Computing Maximal “Polymatroidal” Network Flows***by*E. L. Lawler & C. U. Martel**348-353 Finite-Degree Utility Independence***by*Peter C. Fishburn & Peter H. Farquhar**354-360 An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem***by*N. Hefetz & I. Adiri**361-382 Renewal Plans and Persistent Optimality in Countably Additive Gambling***by*Robert P. Kertz**383-400 Restricted Primitive Sets and Simplicial Subdivisions with Arbitrary Refinement Factors***by*Ludo Van der Heyden**401-409 Private Information and Pure-Strategy Equilibria***by*Roy Radner & Robert W. Rosenthal**410-425 Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems***by*Laurence A. Wolsey**426-440 Discrete Sequential Search with Positive Switch Cost***by*Udo Lössner & Ingo Wegener**441-462 Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method***by*Karl-Heinz Borgwardt**463-475 On Sufficient Conditions in Nonsmooth Optimization***by*R. W. Chaney**476-478 Totally Balanced Games and Games of Flow***by*Ehud Kalai & Eitan Zemel

### May 1982, Volume 7, Issue 2

**159-171 Closure in Independence Systems***by*Laurence Matthews**172-182 Algebraic Linear Programming***by*A. M. Frieze**183-197 Locating Centers on a Tree with Discontinuous Supply and Demand Regions***by*Arie Tamir & Eitan Zemel**198-210 The Contraction Mapping Approach to the Perron-Frobenius Theory: Why Hilbert's Metric?***by*Elon Kohlberg & John W. Pratt