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: new approach for resolving certain linear optimization problems using separation theory
  name:
    name part: Parija, Gyana Ranjan
    name part: 1967-
    role:
      role term: creator
  name:
    name part: Deuermeyer, Bryan L.
    role:
      role term: degree committee member.
  name:
    name part: Hogg, Gary L.
    role:
      role term: degree committee member.
  name:
    name part: Kuo, Way
    role:
      role term: degree committee member.
  name:
    name part: Wilhelm, Wilbert E.
    role:
      role term: degree supervisor.
  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: 1994
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: x, 115 leaves ; 28 cm
  abstract: This dissertation poses fundamentally new results based on separation theory to resolve a number of issues in linear optimization. First, redundancies present in a collection of linear inequalities are characterized, and two separation procedures, based on strong separation of convex polyhedra, are devised specifically for resolving the redundancy problem. While the first procedure determines whether or not a given inequality is redundant relative to a polyhedron having a nonredundant representation, the second does the same for an arbitrary polyhedron. These separation procedures can be interpreted as determining whether a given vector belongs to a pointed, polyhedral cone and in a convex polytope, respectively. Then, by exploiting the duality relationships existing between separation and optimization, it is shown that the underlying theory can address a number of issues in polyhedral theory such as determining feasibility, dimensionality and boundedness of arbitrary polyhedra. The separation procedures are then specialized to resolve binary integer programming problems. As a fundamental result, it is shown that, for positive 0/1 programming problems, the separation procedures can generate facets of the underlying polytope in a number of steps that is polynomial in the problem size. A set of selected test problems is used to evaluate the computational characteristics of the solution procedure on binary problems arising in real-world applications. Computational evaluation focuses on solving assembly system design problems since this work is sponsored by an ongoing project directed toward that important area.
  note: by Gyana Ranjan Parija.
  note: "Major subject: Industrial Engineering."
  note: Vita.
  note: Ph. D. Texas A & M University 1994
  note: Includes bibliographical references.
  subject:
    topic: Major industrial engineering
  identifier: http://proxy.library.tamu.edu/login
  identifier: https://hdl.handle.net/1969.1/DISSERTATIONS-1516797
  related item:
    location:
      url: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: https://hdl.handle.net/1969.1/DISSERTATIONS-1516797
  record info:
    record content source: TXA
    record creation date: 960209
    record change date: 20220103134919.0
    record identifier: in00001266288
    language of cataloging:
      language term: eng