2009
DOI: 10.1016/j.ejor.2008.12.019
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced-interval linear programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
24
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 51 publications
(24 citation statements)
references
References 32 publications
0
24
0
Order By: Relevance
“…, (i = 1, 2..., n). In other words, x  is Pareto optimal if there exists no feasible vector of decision variables in the search space which would decrease some objectives without causing an increase in at least one other objective simultaneously (Zhou et al, 2009). …”
Section: Solution Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…, (i = 1, 2..., n). In other words, x  is Pareto optimal if there exists no feasible vector of decision variables in the search space which would decrease some objectives without causing an increase in at least one other objective simultaneously (Zhou et al, 2009). …”
Section: Solution Approachmentioning
confidence: 99%
“…In order to overcome this problem some researchers have applied interval programming. In really using interval programming does not require the specification or the assumption of probabilistic distribution (as in stochastic programming) or possibility distributions (as in fuzzy programming) (Zhou et al, 2009). Hence, it is a good idea for the decision makers to determine the uncertain as intervals.…”
Section: Introductionmentioning
confidence: 99%
“…However, the increasing data requirements for specifying probability density or parameter membership functions have become a big challenge for TMDL allocations [7,14]. Even when many data are available, the computational algorithms for stochastic or fuzzy optimization models, such as nonlinear programming (NP) or modern heuristic global searches, may face complex or nonlinear problems [19,20]. For example, traditional NP algorithms, including both gradient and non-gradient based ones, were limited to local optima upon solving the aforementioned SOM framework [11,21].…”
Section: Introductionmentioning
confidence: 99%
“…The SOM framework under uncertainty can be grouped into four broad categories: namely stochastic optimization models, fuzzy optimization models, interval optimization models and hybrids of the above three model types [15][16][17][18][19]. However, the increasing data requirements for specifying probability density or parameter membership functions have become a big challenge for TMDL allocations [7,14].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation