Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Duality for Multiple Objective Convex Programs

Pages:159–172

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.159

Preview Abstract
Stationary Distributions of Flows in Jackson Networks

Pages:173–185

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.173

Preview Abstract
Information Conditions, Communication and General Equilibrium

Pages:186–189

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.186

Preview Abstract
A Decomposition Algorithm for Sequencing with General Precedence Constraints

Pages:190–204

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.190

Preview Abstract
Singular Games have Asymptotic Values

Pages:205–212

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.205

Preview Abstract
A Column Generation Technique for the Computation of Stationary Points

Pages:213–224

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.213

Preview Abstract
Exponential Lower Bounds on a Class of Knapsack Algorithms

Pages:225–232

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.225

Preview Abstract
Proof of Convergence for a Modification of Goldfarb's Algorithm

Pages:233–245

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.233

Preview Abstract
The Compensation Method Applied to a One-Product Production/Inventory Problem

Pages:246–262

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.246

Preview Abstract
A Stochastic Process Approach to Multivariate Reliability Systems: Notions Based on Conditional Stochastic Order

Pages:263–276

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.263

Preview Abstract
A Decomposition Methodology and a Class of Algorithms for the Solution of Nonlinear Equations

Pages:277–292

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.277

Preview Abstract
On Team Guessing with Independent Information

Pages:293–304

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.293

Preview Abstract
Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan

Pages:305–312

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.305

Preview Abstract
Incomplete Information Games with Transcendental Values

Pages:313–318

Published Online:May 1, 1981

https://doi.org/10.1287/moor.6.2.313

Preview Abstract
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree