Multi-choice multi-objective linear programming problem

Biswal, M. P.; Acharya, Srikumar

doi:10.1080/09720502.2009.10700650

Cited by 17 publications

(23 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since 2 1 < k i < 2 2 , so we need two binary variables z (1) i and z (2) i . We express 3 as 2 2 + 2 1 or 2 1 + 2 0 .…”

Section: Case (I) For K I =mentioning

confidence: 99%

“…Out of two goals b (1) i and b (2) i one of them is to be selected. Since the total number of elements of the set is 2, only one binary variable is required.…”

Section: Case (I) For K I =mentioning

confidence: 99%

“…The right hand side set has three goals b (1) i , b (2) i and b (3) i out of which one is to be selected. Since 2 1 < k i < 2 2 , so we need two binary variables z (1) i and z (2) i .…”

Section: Case (I) For K I =mentioning

confidence: 99%

“…Since the total number of elements of the set is 2, only one binary variable is required. Taking the help of one binary variable z (1) i , a deterministic constraint is formulated as …”

Section: Case (I) For K I =mentioning

confidence: 99%

“…In his work a multi-choice parameter can accommodate at best three choices. Recently, Biswal and Acharya [1,2] proposed transformation techniques to transform multi-choice linear programming problems (MCLPP) (both single objective and multi-objective) to equivalent mathematical models, which are solved with the help of existing methodology.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Solving probabilistic programming problems involving multi-choice parameters

Acharya

Biswal

2011

OPSEARCH

Self Cite

View full text Add to dashboard Cite

Probabilistic programming is used in some optimization problems where some or all parameters are considered as random variables, in order to deal with uncertainty, which is an inherent feature of the system. The situation of multiple parameters may exist in a decision making problem in our real life. The multi-choice programming can not only avoid the underestimation of parameters, but also can decide the appropriate parameter from multiple parameters. This paper deals with a probabilistic linear programming problem, where the right hand side parameters of probabilistic constraints are multichoice in nature and rest of the parameters are independent random variables. In this paper the probabilistic programming problem is converted to an equivalent deterministic mathematical programming model. The resulting model is then solved by standard linear or non-linear programming techniques. A numerical example is presented to illustrate the methodology.

show abstract

“…Since 2 1 < k i < 2 2 , so we need two binary variables z (1) i and z (2) i . We express 3 as 2 2 + 2 1 or 2 1 + 2 0 .…”

Section: Case (I) For K I =mentioning

confidence: 99%

“…Out of two goals b (1) i and b (2) i one of them is to be selected. Since the total number of elements of the set is 2, only one binary variable is required.…”

Section: Case (I) For K I =mentioning

confidence: 99%

“…The right hand side set has three goals b (1) i , b (2) i and b (3) i out of which one is to be selected. Since 2 1 < k i < 2 2 , so we need two binary variables z (1) i and z (2) i .…”

Section: Case (I) For K I =mentioning

confidence: 99%

“…Since the total number of elements of the set is 2, only one binary variable is required. Taking the help of one binary variable z (1) i , a deterministic constraint is formulated as …”

Section: Case (I) For K I =mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations