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...
Saved in:
Main Authors: | M. Allahdadi", H. Mishmast Nehi |
---|---|
Language: | English |
Published: |
Science Faculty of Chiang Mai University
2019
|
Subjects: | |
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 |
Similar Items
-
A nonlinear interval number programming method for uncertain optimization problems
by: Jiang, C., et al.
Published: (2014) -
Partially linear transformation cure models for interval-censored data
by: Hu, Tao, et al.
Published: (2017) -
Interval cancers following breast cancer screening in Singaporean women
by: Gao, F., et al.
Published: (2014) -
Optimization of structures with uncertain constraints based on convex model and satisfaction degree of interval
by: Jiang, C., et al.
Published: (2014) -
Mining relationships among interval-based events for classification
by: Patel, D., et al.
Published: (2013)