SCHEDULING RESERVOIR OIL PRODUCTION BY LINEAR PROGRAMMING AND THE NEYMAN-PEARSON LEMMA

Abstract

In a set of n oil wells located in reservoirs without communications, one wishes to schedule the flowrate of each individual well in such a way that the following conditions are satisfied: the pressure drop of each individual well is less than or equal to a given value, the production of any well is bounded by lower and upper technical limits, the total production of the fields has to satisfy a certain demand with some specific technical limiting capacities, the total discounted profit of the oil production is maximized. Following the basic fluid and cash flow mechanisms of the system, two flowrate arrangements will be considered, namely: discrete flowrate, continuous flowrate. They will be applied to systems including single or multiwells through a linear programming model and an attempt to use the Neyman-Pearson lemma.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1966
Accession Number
AD0646239

Entities

People

  • Michel Ruche

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Coefficients
  • Computer Programming
  • Convergence
  • Economics
  • Equations
  • Flow
  • Fluid Flow
  • Inequalities
  • Intervals
  • Linear Programming
  • Oil Wells
  • Operations Research
  • Production
  • Productivity
  • Reservoirs
  • Scheduling (Production)
  • United States

Readers

  • Combustion and Flow Dynamics.
  • Industrial Economics
  • Operations Research