2017
DOI: 10.1007/s12597-016-0290-5
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective bilevel fuzzy probabilistic programming problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
7
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 18 publications
0
7
0
Order By: Relevance
“…, , -, -≥ 0 (12) where -N , " = 1, … , ! + , are Lagrange multipliers, and note that complementary slackness (11) For " ∈ G r u , the variables -N or p N are assume any nonnegative value in the solution of model in Equation (8)(9)(10)(11)(12), without the complementary term 11 , so complementary slackness will not necessarily be satisfied. The proposed procedure is summarized in the following Bard and Moore in 1990 [11,17,27]:…”
Section: Branch and Bound Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…, , -, -≥ 0 (12) where -N , " = 1, … , ! + , are Lagrange multipliers, and note that complementary slackness (11) For " ∈ G r u , the variables -N or p N are assume any nonnegative value in the solution of model in Equation (8)(9)(10)(11)(12), without the complementary term 11 , so complementary slackness will not necessarily be satisfied. The proposed procedure is summarized in the following Bard and Moore in 1990 [11,17,27]:…”
Section: Branch and Bound Algorithmmentioning
confidence: 99%
“…Set -N = 0 for " ∈ G r S and p N = 0 for " ∈ G r t . Attempt to solve Equation (8)(9)(10)(11)(12), without (11) if the solution is infeasible, go to Step 6. Otherwise, put = + 1 and label the solution as r , r , -r , go to Step 3.…”
Section: Branch and Bound Algorithmmentioning
confidence: 99%
See 3 more Smart Citations