The optimal value bounds of the objective function in the interval linear programming problem

The optimal value bounds of the objective function in the interval linear programming problem

In 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 me...

Full description

Saved in:
Bibliographic Details
Main Authors: M. Allahdadi", H. Mishmast Nehi
Language:English
Published: Science Faculty of Chiang Mai University 2019
Subjects:
Interval linear programming
interval coefficient
interval systems
Online Access:http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=5771
http://cmuir.cmu.ac.th/jspui/handle/6653943832/66814
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
Language: English
id th-cmuir.6653943832-66814
record_format dspace
spelling th-cmuir.6653943832-668142019-09-17T08:55:04Z The optimal value bounds of the objective function in the interval linear programming problem M. Allahdadi" H. Mishmast Nehi Interval linear programming interval coefficient interval systems In 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. 2019-09-17T08:55:04Z 2019-09-17T08:55:04Z 2015 Chiang Mai Journal of Science 42, 2 (April 2015), 501 - 511 0125-2526 http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=5771 http://cmuir.cmu.ac.th/jspui/handle/6653943832/66814 Eng Science Faculty of Chiang Mai University
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
language English
topic Interval linear programming
interval coefficient
interval systems
spellingShingle Interval linear programming
interval coefficient
interval systems
M. Allahdadi"
H. Mishmast Nehi
The optimal value bounds of the objective function in the interval linear programming problem
description In 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.
author M. Allahdadi"
H. Mishmast Nehi
author_facet M. Allahdadi"
H. Mishmast Nehi
author_sort M. Allahdadi"
title The optimal value bounds of the objective function in the interval linear programming problem
title_short The optimal value bounds of the objective function in the interval linear programming problem
title_full The optimal value bounds of the objective function in the interval linear programming problem
title_fullStr The optimal value bounds of the objective function in the interval linear programming problem
title_full_unstemmed The optimal value bounds of the objective function in the interval linear programming problem
title_sort optimal value bounds of the objective function in the interval linear programming problem
publisher Science Faculty of Chiang Mai University
publishDate 2019
url http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=5771
http://cmuir.cmu.ac.th/jspui/handle/6653943832/66814
_version_ 1681426525193240576

Similar Items