## Content

### May 1982, Volume 7, Issue 2

**211-222 The Generalized Quasi-Variational Inequality Problem***by*D. Chan & J. S. Pang**223-244 Sojourn Times in Queueing Networks***by*Benjamin Melamed**245-252 Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems***by*Philip C. Jones & Earl S. Marwil**253-261 On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid***by*Michael J. Todd**262-271 Queue Disciplines in Heavy Traffic***by*J. F. C. Kingman**272-294 A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem***by*R. D. Doverspike & C. E. Lemke**295-313 A Refinement Procedure for Computing Fixed Points Using Scarf's Primitive Sets***by*Ludo van der Heyden**314-318 Projection in Certain Spaces of Set Functions***by*William H. Ruckle

### February 1982, Volume 7, Issue 1

**1-13 On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games***by*G. van der Laan & A. J. J. Talman**14-31 Optimal Behavioral Strategies In 0-Sum Games with Almost Perfect Information***by*Jean-Pierre Ponssard & Sylvain Sorin**32-39 Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure***by*Louis J. Billera & David C. Heath**40-56 Demand Compatible Equitable Cost Sharing Prices***by*Leonard J. Mirman & Yair Tauman**57-66 Unit Execution Time Shop Problems***by*Teofilo Gonzalez**67-80 Odd Minimum Cut-Sets and b -Matchings***by*Manfred W. Padberg & M. R. Rao**81-87 Leontief Substitution Systems and Matroid Complexes***by*J. Scott Provan & Louis J. Billera**88-94 Existence of Limiting Distributions in the GI / G / s Queue***by*Ward Whitt**95-110 A Duality Theorem in Multiobjective Nonlinear Programming***by*Hidefumi Kawasaki**111-128 On Markov Jump Processes Imbedded at Jump Epochs and Their Queueing-Theoretic Applications***by*Benjamin Melamed**129-138 Insensitive Generalized Semi-Markov Schemes with Point Process Input***by*Werner E. Helm & Rolf Schassberger**139-153 Minimax Policies for Unobservable Inspections***by*Harvey Diamond**154-157 A Remark on Search and Sequencing Problems***by*F. P. Kelly

### November 1981, Volume 6, Issue 4

**475-484 Equivalence of LCP and PLS***by*B. C. Eaves & C. E. Lemke**485-492 Law of Large Numbers for Random Sets and Allocation Processes***by*Zvi Artstein & Sergiu Hart**493-512 Convergence of Dynamic Programming Models***by*Hans-Joachim Langen**513-517 A New Look at the Existence of P -Optimal Policies in Dynamic Programming***by*E. J. Balder**518-529 Constrained Optimization of Functionals with Search Theory Applications***by*Walter R. Stromquist & Lawrence D. Stone**530-550 Regularity and Stability of Equilibrium Points of Bimatrix Games***by*M. J. M. Jansen**551-562 The Failure and Hazard Processes in Multivariate Reliability Systems***by*Elja Arjas**563-570 Distribution of the Interoverflow Time for the GI / G /1 Loss System***by*S. Halfin**571-578 The Number of Outcomes in the Pareto-Optimal Set of Discrete Bargaining Games***by*Barry O'Neill**579-592 Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere***by*Michael J. Todd**593-607 Conjugate Relations and Weak Subdifferentials of Relations***by*Hidefumi Kawasaki**608-629 Brownian Excursion, the M / M /1 Queue and Their Occupation Times***by*J. W. Cohen & G. Hooghiemstra

### August 1981, Volume 6, Issue 3

**319-332 Measuring the Quality of Approximate Solutions to Zero-One Programming Problems***by*Eitan Zemel**333-348 Algorithms for Linear Programming Problems with Interval Objective Function Coefficients***by*Ralph E. Steuer**349-362 A Stochastic Solution Concept for n -Person Games***by*Edward W. Packel**363-373 A Nonorthogonal Fourier Expansion for Conic Decomposition***by*J. Barzilai & A. Ben-Tal**374-378 Complete Convergence of Short Paths and Karp's Algorithm for the TSP***by*J. Michael Steele**379-386 Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information***by*S. Lakshmivarahan & Kumpati S. Narendra**387-404 Flows in Queueing Networks: A Martingale Approach***by*J. Walrand & P. Varaiya**405-419 A Dynamic Programming Model of Fractional Flows with Application to Maintenance and Replacement Problems***by*James Flynn**420-423 Cores of Nonatomic Linear Production Games***by*Louis J. Billera & Joseph Raanan**424-436 Proximal Subgradients, Marginal Values, and Augmented Lagrangians in Nonconvex Optimization***by*R. T. Rockafellar**437-444 Globally Convergent Algorithms for Convex Programming***by*Eric Rosenberg**445-452 A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees***by*Imre Bárány**453-461 Multivariate Classes of Life Distributions in Reliability Theory***by*Henry W. Block & Thomas H. Savits**462-474 Equivalence of Nonlinear Complementarity Problems and Least Element Problems in Banach Lattices***by*R. C. Riddell

### May 1981, Volume 6, Issue 2

**159-172 Duality for Multiple Objective Convex Programs***by*Shelby Brumelle**173-185 Stationary Distributions of Flows in Jackson Networks***by*J. Labetoulle & G. Pujolle & C. Soula**186-189 Information Conditions, Communication and General Equilibrium***by*Pradeep Dubey & Martin Shubik**190-204 A Decomposition Algorithm for Sequencing with General Precedence Constraints***by*Jeffrey B. Sidney**205-212 Singular Games have Asymptotic Values***by*Abraham Neyman**213-224 A Column Generation Technique for the Computation of Stationary Points***by*Jong-Shi Pang**225-232 Exponential Lower Bounds on a Class of Knapsack Algorithms***by*Dirk Hausmann & Ravindran Kannan & Bernhard Korte**233-245 Proof of Convergence for a Modification of Goldfarb's Algorithm***by*Jürgen Fischer**246-262 The Compensation Method Applied to a One-Product Production/Inventory Problem***by*Stephen C. Graves & Julian Keilson**263-276 A Stochastic Process Approach to Multivariate Reliability Systems: Notions Based on Conditional Stochastic Order***by*Elja Arjas**277-292 A Decomposition Methodology and a Class of Algorithms for the Solution of Nonlinear Equations***by*Aram K. Kevorkian**293-304 On Team Guessing with Independent Information***by*H. S. Witsenhausen**305-312 Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan***by*Ludo van der Heyden**313-318 Incomplete Information Games with Transcendental Values***by*Jean-François Mertens & Shmuel Zamir

### February 1981, Volume 6, Issue 1

**1-13 Cooperative Fuzzy Games***by*Jean-Pierre Aubin**14-18 An Exact Penalty Method for Mixed-Integer Programs***by*C. E. Blair & R. G. Jeroslow**19-30 Minimization by Random Search Techniques***by*Francisco J. Solis & Roger J.-B. Wets**31-49 The System Point Method in Exponential Queues: A Level Crossing Approach***by*P. H. Brill & M. J. M. Posner**50-57 Location on Tree Networks: P -Centre and n -Dispersion Problems***by*R. Chandrasekaran & A. Daughety**58-73 Optimal Auction Design***by*Roger B. Myerson**74-87 Analysis of Greedy Solutions for a Replacement Part Sequencing Problem***by*D. K. Friesen & B. L. Deuermeyer**88-100 The Lexicographic Kernel of a Cooperative Game***by*Moshe Yarom**101-112 On the Generality of the Subadditive Characterization of Facets***by*Ellis L. Johnson**113-121 Relationships Between Some Notions Which are Common to Reliability Theory and Economics***by*Mahesh Chandra & Nozer D. Singpurwalla**122-128 Value Theory Without Efficiency***by*Pradeep Dubey & Abraham Neyman & Robert James Weber**129-139 A Modified Integer Labeling for Complementarity Algorithms***by*Peter M. Reiser**140-152 Discontinuous Optimization by Smoothing***by*Israel Zang**153-158 Minimizing Maximum Lateness in a Two-Machine Open Shop***by*E. L. Lawler & J. K. Lenstra & A. H. G. Rinnooy Kan

### November 1980, Volume 5, Issue 4

**481-486 The Optimal Choice of a Subset of a Population***by*R. J. Vanderbei**487-493 Maximum Wealth Trees***by*F. K. Hwang**494-501 Continuity of Generalized Semi-Markov Processes***by*Ward Whitt**502-509 Multilinear Expected Utility***by*Peter C. Fishburn**510-522 On Piecewise Linear Functions and Piecewise Linear Equations***by*Ruben Schramm**523-552 Values and Derivatives***by*Jean-François Mertens**553-555 A Relationship Between Partial Derivatives of the Reliability Function of a Coherent System and its Minimal Path (Cut) Sets***by*Emad El-Neweihi**556-566 Convergent Algorithms for Minimizing a Concave Function***by*Nguyen Van Thoai & Hoang Tuy**567-575 Optimal Stopping for a Markov Process: A New Characterisation of the Optimal Policy***by*J. M. McNamara**576-594 Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra***by*J. Scott Provan & Louis J. Billera**595-598 A 3-Sphere Counterexample to the W v -Path Conjecture***by*Peter Mani & David W. Walkup**599-601 The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4***by*Michael J. Todd**602-602 Erratum: The Principal Maxmin Matrix Transversal Strategy***by*Aram K. Kevorkian

### August 1980, Volume 5, Issue 3

**321-357 Converting Linear Programs to Network Problems***by*Robert E. Bixby & William H. Cunningham**358-365 On the Number of Component Failures in Systems Whose Component Lives are Exchangeable***by*Sheldon M. Ross & Mehrdad Shahshahani & Gideon Weiss**366-372 Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations***by*Elon Kohlberg**373-380 The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities***by*Ingo Wegener**381-387 A General Failure Model: Optimal Replacement with State Dependent Replacement and Failure Costs***by*E. Nummelin**388-414 The Relaxation Method for Solving Systems of Linear Inequalities***by*J. L. Goffin**415-421 An Analysis of Preemptive Multiprocessor Job Scheduling***by*Jeffrey M. Jaffe**422-434 Circular Cuts in a Network***by*T. C. Hu & F. Ruskey**435-443 Locating an Isolated Global Minimizer of a Constrained Nonconvex Program***by*Garth P. McCormick**444-459 Accretive Operators and Markov Decision Processes***by*Stanley R. Pliska**460-466 Jackson’s Conjecture on Earliest Due Date Scheduling***by*Henry M. Goldberg**467-479 Optimal Parameter Selection of Parabolic Systems***by*D. W. Reid & K. L. Teo

### May 1980, Volume 5, Issue 2

**161-166 Competitive Optimality of Logarithmic Investment***by*Robert M. Bell & Thomas M. Cover**167-185 A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets***by*T. H. Matheiss & David S. Rubin**186-196 Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector***by*Satoru Fujishige**197-228 Measure-Based Values of Market Games***by*Sergiu Hart**229-241 On the Exponent of a Primitive, Nearly Reducible Matrix***by*Richard A. Brualdi & Jeffrey A. Ross**242-257 Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths***by*Michael J. Todd**258-266 Theoretical Efficiency of the Algorithm “Capacity” for the Maximum Flow Problem***by*Maurice Queyranne**267-270 Asymptotic Semivalues and a Short Proof of Kannai’s Theorem***by*Pradeep Dubey**271-279 Characterization of Optimal Policies in Vector-Valued Markovian Decision Processes***by*Nagata Furukawa**280-284 Sets of Generalized Complementarity Problems and P -Matrices***by*George J. Habetler & Michael M. Kostreva**285-292 On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets***by*Martin Grötschel**293-307 On the Optimality of ((sigma), S ) Policies***by*Dieter Kalin**308-320 On the Behavior of the Optimal Value Operator of Dynamic Programming***by*Willem K. Klein Haneveld

### February 1980, Volume 5, Issue 1

**1-26 Combinatorial Optimization: What is the State of the Art***by*Victor Klee**27-34 Probabilistic Analysis of the Planar k -Median Problem***by*M. L. Fisher & D. S. Hochbaum**35-42 Extreme Points of the Class of Discrete Decreasing Failure Rate Life Distributions***by*Naftali A. Langberg & Ramón V. León & James Lynch & Frank Proschan**43-62 Strongly Regular Generalized Equations***by*Stephen M. Robinson**63-66 A Note on Optimally Dissecting Simplices***by*Michael J. Todd & Robert C. Acar**67-85 Some Useful Functions for Functional Limit Theorems***by*Ward Whitt**86-93 Asymptotic Value of Mixed Games***by*Francoise Fogelman & Martine Quinzii**94-100 Stochastic Dominance and Moments of Distributions***by*Peter C. Fishburn**101-109 On the Relationship Between Conditions that Insure a PL Mapping is a Homeomorphism***by*M. Kojima & R. Saigal**110-119 Comparing Semi-Markov Processes***by*David Sonderman**120-125 Conditions for Convexity of Quasiconvex Functions***by*J. P. Crouzeix**126-134 Optimal Stopping with a Horizon Constraint***by*David C. Nachman**135-146 Rational Mixed-Integer and Polyhedral Union Minimization Models***by*R. R. Meyer & M. V. Thakkar & W. P. Hallman**147-159 Analysis of the Exceptional Queueing System by the Use of Regenerative Processes and Analytical Methods***by*Do Le Minh

### November 1979, Volume 4, Issue 4

**303-338 Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts***by*M. Maschler & B. Peleg & L. S. Shapley**339-356 Fast Approximation Algorithms for Knapsack Problems***by*Eugene L. Lawler**357-378 Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis***by*B. Pittel**379-389 Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks***by*K. Truemper & Y. Soun**390-405 An Approach to Homotopy and Degree Theory***by*C. B. Garcia & W. I. Zangwill**406-413 Almost Sure Comparisons of Renewal Processes and Poisson Processes, with Application to Reliability Theory***by*Douglas R. Miller**414-424 Combinatorial Optimization with Rational Objective Functions***by*Nimrod Megiddo**425-430 The Generic Nature of Optimality Conditions in Nonlinear Programming***by*J. E. Spingarn & R. T. Rockafellar**431-440 Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets***by*Lawrence D. Stone**441-447 Inequalities for the Completion Times of Stochastic PERT Networks***by*Luc P. Devroye**448-457 Complexity of Scheduling Shops with No Wait in Process***by*Sartaj Sahni & Yookun Cho**458-463 The Generalized Gradient of a Marginal Function in Mathematical Programming***by*Jacques Gauvin**464-477 A Complementary Pivoting Approach to Parametric Nonlinear Programming***by*Masakazu Kojima

### August 1979, Volume 4, Issue 3

**209-214 Computing Economic Equilibria on Affine Networks with Lemke's Algorithm***by*Richard Asmuth & B. Curtis Eaves & Elmor L. Peterson**215-224 Sequencing with Series-Parallel Precedence Constraints***by*Clyde L. Monma & Jeffrey B. Sidney**225-232 Renewal Decision Problem-Random Horizon***by*C. Derman & D. R. Smith**233-235 A Greedy Heuristic for the Set-Covering Problem***by*V. Chvatal**236-264 The Partition Value***by*Abraham Neyman & Yair Tauman**265-267 On Fulkerson's Conjecture About Consistent Labeling Processes***by*Nimrod Megiddo & Zvi Galil**268-273 Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs***by*O. L. Mangasarian**274-290 The Principal Maxmin Matrix Transversal Strategy***by*Aram K. Kevorkian**291-302 Penalty Lagrangian Methods Via a Quasi-Newton Approach***by*Shih-Ping Han

### May 1979, Volume 4, Issue 2

**99-131 Mathematical Properties of the Banzhaf Power Index***by*Pradeep Dubey & Lloyd S. Shapley**132-143 Matroids and a Reliability Analysis Problem***by*Michael O. Ball & George L. Nemhauser**144-152 Overtaking Optimality for Markov Decision Chains***by*Eric V. Denardo & Uriel G. Rothblum**153-161 On Piecewise Linear Approximations to Smooth Mappings***by*R. Saigal**162-178 Reneging Phenomena in Single Channel Queues***by*Robert E. Stanford**179-185 Approximations of Dynamic Programs, II***by*Ward Whitt**186-195 Expected Utility in Two-Person Games***by*Ernst-Wilhelm Zachow**196-208 Theoretical Properties of the Network Simplex Method***by*W. H. Cunningham

### February 1979, Volume 4, Issue 1

**1-14 Determining All Solutions to Certain Systems of Nonlinear Equations***by*C. B. Garcia & W. I. Zangwill**15-30 Universally Measurable Policies in Dynamic Programming***by*Steven E. Shreve & Dimitri P. Bertsekas**31-38 Quotatone Apportionment Methods***by*M. L. Balinski & H. P. Young**39-59 A Strongly Convergent Primal Simplex Algorithm for Generalized Networks***by*Joyce Elam & Fred Glover & Darwin Klingman**60-69 On the Convergence of Policy Iteration in Stationary Dynamic Programming***by*Martin L. Puterman & Shelby L. Brumelle**70-78 Semi-Regenerative Processes with Unbounded Rewards***by*Helmut Schellhaas**79-97 Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces***by*J. B. Hiriart-Urruty

### November 1978, Volume 3, Issue 4

**265-274 Threat Equilibria and Fair Settlements in Cooperative Games***by*Roger B. Myerson**275-281 Coherent Systems with Multi-State Components***by*Richard E. Barlow & Alexander S. Wu**282-289 A Theorem on Homotopy Paths***by*C. B. Garcia & F. J. Gould**290-307 Values of Large Games II: Oceanic Games***by*J. W. Milnor & L. S. Shapley**308-321 The Functional Equations of Undiscounted Markov Renewal Programming***by*P. J. Schweitzer & A. Federgruen**322-333 Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem***by*Alan Stickney & Layne Watson**334-351 An Axiomatic Theory of Tournament Aggregation***by*B. Monjardet

### August 1978, Volume 3, Issue 3

**177-188 Best Algorithms for Approximating the Maximum of a Submodular Set Function***by*G. L. Nemhauser & L. A. Wolsey**189-196 Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree***by*Nimrod Megiddo**197-204 Approximation Algorithms for Certain Scheduling Problems***by*Oscar H. Ibarra & Chul E. Kim**205-223 Approximating Many Server Queues by Means of Single Server Queues***by*Elja Arjas & Tapani Lehtonen**224-230 The Hirsch Conjecture Fails for Triangulated 27-Spheres***by*David W. Walkup**231-243 Approximations of Dynamic Programs, I***by*Ward Whitt**244-256 Conjugate Gradient Methods with Inexact Searches***by*David F. Shanno**257-264 Attainable Sets of Quasiconcave Markets, II: Convexifiable Sets***by*Robert James Weber

### May 1978, Volume 3, Issue 2

**89-101 An Asymptotic, Probabilistic Analysis of a Routing Problem***by*David M. Stein**102-103 Discovering Hidden Totally Leontief Substitution Systems***by*George B. Dantzig & Arthur F. Veinott**104-125 On Stochastic Games with Stationary Optimal Strategies***by*Truman Bewley & Elon Kohlberg**126-132 On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm***by*Michael J. Todd**133-144 Properties of the Process of Level Crossings During a Busy Cycle of the M / G /1 Queueing System***by*J. W. Cohen**145-154 Some Basis Theorems for Integral Monoids***by*Robert G. Jeroslow**155-170 A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs***by*Richard W. Cottle & Jong-Shi Pang**171-175 Convex Operators and Supports***by*S. L. Brumelle

### February 1978, Volume 3, Issue 1

**1-9 Values of Large Games, I: A Limit Theorem***by*N. Z. Shapiro & L. S. Shapley**10-16 A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates***by*Shelby L. Brumelle**17-36 Studies on Piecewise-Linear Approximations of Piecewise- C 1 Mappings in Fixed Points and Complementarity Theory***by*Masakazu Kojima**37-41 Markov Strategies in Dynamic Programming***by*K. M. Van Hee**42-56 A Characterization of the Rau Class of Sequential Problems***by*Joseph B. Kadane**57-66 The Recurrence Classification of Risk and Storage Processes***by*J. Michael Harrison & Sidney I. Resnick**67-81 Optimal Inspections in a Stochastic Control Problem with Costly Observations, II***by*Robert F. Anderson & Avner Friedman**82-88 Optimal Allocations of Continuous Resources to Several Activities with a Concave Return Function---Some Theoretical Results***by*J. M. Einbu

### November 1977, Volume 2, Issue 4

**297-310 On Level Crossings and Cycles in Dam Processes***by*J. W. Cohen & Michael Rubinovitch**311-319 The Duality between Suboptimization and Parameter Deletion***by*Elmor L. Peterson**320-330 On the Complexity of Mean Flow Time Scheduling***by*Ravi Sethi**331-337 A Nondiagonal Value on a Reproducing Space***by*Yair Tauman**338-342 Continuous Values are Diagonal***by*Abraham Neyman