rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    non sort: A
    title: lagrangean relaxation based procedure for minimizing offshore oil and gas field investment
  name:
    name part: Garcia-Diaz, Juan Carlos
    name part: 1963-
    role:
      role term: creator
  name:
    name part: Hogg, Gary L.
    role:
      role term: degree supervisor.
  name:
    name part: Malave, Cesar O.
    role:
      role term: degree committee member.
  name:
    name part: Startzman, Richard
    role:
      role term: degree committee member.
  name:
    name part: Wilhelm, Wilbert E.
    role:
      role term: degree committee member.
  name:
    name part: Texas A & M University
    role:
      role term: degree granting institution.
  type of resource: text
  genre: bibliography
  genre: Academic theses
  origin info:
    place:
      place term: xx
    date issued: 1991
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: xii, 159 leaves : illustrations ; 29 cm
  abstract: The main decisions concerning the development of an offshore oil and/or gas field are: 1. how many, what types, and what sizes of production facilities should be used in the development of the field, 2. where should those facilities be located, and 3. how should a given number of wells among several candidate well sites be assigned to the selected facilities. Such a problem is known as the "offshore location-allocation problem" and is formulated here as a pure 0-1 integer programming model in which the objective is to minimize investments for the development of the field. A tree search procedure to find the optimal solution to this prolem is developed. The most important elements of this procedure are the methods to find lower and upper bounds, a node simplification procedure, and a two-level branch and bound tree. A lower bound is found by solving a Lagrangean relaxation of the original problem. The values for the multipliers in this relaxation are found by a dual ascent procedure. This bound is then tightened by adding a Benders inequality generated from model data. An upper bound is generated by constructing a feasible solution to the problem using the solution to the Lagrangean problem. The node simplification procedure is simply a dominance rule for fixing "free" location variables based on a lower bound for the cost savings associated with such decisions. These mechanisms were embedded in a two-level branch and bound tree. In the first level, the search is concentrated on the facility location decisions; whereas, in the second level, the search is conducted on the well assignment decisions. Ten different examples, all with real data, were used to test the overall methodology. Duality gaps associated with the initial lower bounds and execution times appear to be remarkably small for the size and complexity of the examples. This methodology was compared with a state-of-the-art code specially designed for zero-one integer programming. Computational results indica…
  note: Typescript (photocopy).
  note: Vita.
  note: "Major subject: Industrial Engineering."
  note: Ph. D. Texas A & M University 1991
  note: Includes bibliographical references.
  subject:
    topic: Offshore oil industry
    topic: Economic aspects
  subject:
    topic: Offshore gas industry
    topic: Economic aspects
  subject:
    topic: Investments
    topic: Mathematical models
  subject:
    topic: Major industrial engineering
  identifier: http://gateway.proquest.com/openurl
  identifier: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: http://gateway.proquest.com/openurl
  record info:
    record content source: TXA
    record creation date: 920224
    record change date: 20200904152549.0
    record identifier: in00001073243
    language of cataloging:
      language term: eng