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:
    title: Nonlinear programming in multiple response optimization problems
  name:
    name part: Hocking, R. R. (Ronald R.)
    name part: 1932-
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Claypool, P. Larry
    name part: 1939-
    role:
      role term: author.
  name:
    name part: Ohlendorf, C. G.
    role:
      role term: author.
  name:
    name part: Texas A & M University
    name part: Institute of Statistics,
    role:
      role term: issuing body.
  name:
    name part: United States
    name part: Office of Naval Research,
    role:
      role term: sponsoring body.
  name:
    name part: Texas A & M Research Foundation
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: txu
    date issued: 1968
    issuance: monographic
  language:
    language term: eng
  physical description:
    extent: 76 leaves, 6 unnumbered leaves ; 28 cm
  abstract: A parametric programming algorithm is developed which will allow one to solve a sequence of closely related convex programming problems sequentially. This algorithm is developed in such a manner as to become an extension to the general convex programming algorithm developed by Hartley and Hocking (1963). In terms of statistical response surface analysis, convex parametric problems arise when it is desirable to simultaneously optimize a number of response surface functions within a given experimental region. In general, this is not possible, however, one may choose to optimize a specified one of these response surface functions subject to the conditions that the others achieve certain desired activity levels. In many situations these activity levels are not clearly defined and a parametric study over several combinations of values of meaningful activity levels is indicated. Extensions of the parametric procedure allows for the solution of non-convex quadratic programming problems with quadratic restrictions in the sense that at least one and usually several local optima are obtained. Combining the parametric study with the ability to handle non-convex functions will allow a thorough analysis of the multiple response problem.
  note: by R. R. Hocking, P. L. Claypool and C. G. Ohlendorf.
  note: "May 2, 1968."
  note: "Research conducted through the Texas A&M Research Foundation."
  note: "This report has been adapted from a thesis prepared by P. L. Claypool for his Ph.D. in Statistics."
  note: Photocopy. [College Station, Tex.?]
  note: Includes bibliographical references (leaves 70-71).
  note: Technical report.
  note: Sponsored by the Office of Naval Research N00014-68-A-0140 NR047-700
  subject:
    topic: Nonlinear programming
  subject:
    topic: Response surfaces (Statistics)
  subject:
    topic: Convex programming
  subject:
    topic: Nonconvex programming
  subject:
    topic: Mathematical optimization
  subject:
    topic: Parametric programming
  classification: T57.8 .H63 1968
  related item:
    title info:
      title: Non-linear programming in multiple response optimization problems
    name:
      name part: Claypool, P. Larry.
    origin info:
      publisher: [College Station, Tex.], 1967
    identifier: (OCoLC)5684142
  related item:
    title info:
      title: Technical report (Texas A & M University. Themis Optimization Research Program) ; no. 1
  record info:
    record content source: TXA
    record creation date: 180418
    record change date: 20191026063049.0
    record identifier: in00004019412
    language of cataloging:
      language term: eng