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 |
---|---|
語言: | English |
出版: |
Science Faculty of Chiang Mai University
2019
|
主題: | |
在線閱讀: | http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=5771 http://cmuir.cmu.ac.th/jspui/handle/6653943832/66814 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
A nonlinear interval number programming method for uncertain optimization problems
由: Jiang, C., et al.
出版: (2014) -
Partially linear transformation cure models for interval-censored data
由: Hu, Tao, et al.
出版: (2017) -
Interval cancers following breast cancer screening in Singaporean women
由: Gao, F., et al.
出版: (2014) -
Optimization of structures with uncertain constraints based on convex model and satisfaction degree of interval
由: Jiang, C., et al.
出版: (2014) -
Mining relationships among interval-based events for classification
由: Patel, D., et al.
出版: (2013)