<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Post-optimality analysis of goal programming problems</title>
  </titleInfo>
  <name type="personal">
    <namePart>Quaddus, Md. Abdul</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Sharif, M. Nawaz</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart> Pakorn Adulbhan</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart> Techapun Raengkhum.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Government of The Netherlands</namePart>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1975</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>66 p.</extent>
  </physicalDescription>
  <abstract>This research work presents some methodologies for post  optimality analysis of goal programming problems. Two types of changes in parameters of goal programming problems have bee considered for this  purpose - (i) Single change in parameters; (ii) Systematic changes in parameters. For single change, sensitivity analysis of linear programm ing problems has been extended to deal with changes in three different parameters of goal programming problems. These are: (i) ranking of priority, (ii) target, and (iii) coefficient of goal equation. Parametric linear programming has also been extended to deal with systematic  changes in targets of goal programming problems. This algorithm helps to find different sets of optimal solutions for different ranges of targets. Finally, illustrative examples on all possible conditions of single and systematic changes in parameters have been presented.</abstract>
  <note>A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand</note>
  <note>Thesis (M.Eng.) - Asian Institute of Technology, 1975</note>
  <subject authority="lcsh">
    <topic>Decision-making</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. 1149</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B24148</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B24148</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">170398</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818172350.0</recordChangeDate>
  </recordInfo>
</mods>
