1. CMU Intellectual Repository
  2. Academic Support Units
  3. Chiang Mai University Library
  4. CMUL: Journal Articles
Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/66814
Full metadata record
DC FieldValueLanguage
dc.contributor.authorM. Allahdadi"en_US
dc.contributor.authorH. Mishmast Nehien_US
dc.date.accessioned2019-09-17T08:55:04Z-
dc.date.available2019-09-17T08:55:04Z-
dc.date.issued2015en_US
dc.identifier.citationChiang Mai Journal of Science 42, 2 (April 2015), 501 - 511en_US
dc.identifier.issn0125-2526en_US
dc.identifier.urihttp://it.science.cmu.ac.th/ejournal/dl.php?journal_id=5771en_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/66814-
dc.description.abstractIn this paper we deal with solving Interval Linear Programming (ILP) problems. The aim of solving ILP problems is finding the best and the worst optimum values for objective function. We consider ILP problems with equality and inequality constraints and we illustrate weakness of the Tong-Shaocheng method for finding the worst value of the objective function when there is at least an equality constraint.en_US
dc.language.isoEngen_US
dc.publisherScience Faculty of Chiang Mai Universityen_US
dc.subjectInterval linear programmingen_US
dc.subjectinterval coefficienten_US
dc.subjectinterval systemsen_US
dc.titleThe optimal value bounds of the objective function in the interval linear programming problemen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.