On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010

Stanojević, Bogdana; Stanojević, Miroslav

doi:10.1016/j.apm.2013.01.041

Cited by 9 publications

(15 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…is a strongly efficient solution to Problem (6)- (7). Otherwise, set x * = x h , h = h + 1 and go to Step 2.…”

Section: Solving the Web Service Selection Problemmentioning

confidence: 99%

“…The use of a novel technique introduced in [7] is proposed for solving the posed problem, in the case of linear-fractional objectives. As shown in the cited paper this technique can be used to generate strongly efficient solutions to a MOLFP problem starting from any feasible solution.…”

Section: Solving the Web Service Selection Problemmentioning

confidence: 99%

“…. , m. Next, since it is convenient to have both numerators and denominators expressed by positive functions [7], and the logarithmic functions do not meet this requirement we scale them by adding a value α l to numerators to render them positive. Since the denominator functions are positive there is no need to adjust them.…”

Section: Solving the Web Service Selection Problemmentioning

confidence: 99%

“…is used successively in the solving procedure P s M O L F [7] for finding an efficient solution to Problem (1)-(2) starting from a given feasible solution x * . Turning back to our case study, and denoting…”

Section: Solving the Web Service Selection Problemmentioning

confidence: 99%

“…In order to reduce the number of the objectives we favorable combine the original objectives and formulate a bi-objective linear fractional programming (BOLFP) problem. Using the procedure introduced in [7] we generate an efficient solution to the BOLFP problem and adopt it as a solution to our initial problem.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Optimization of Multiple-Objective Web Service Selection Using Fractional Programming

Stanojević

Turajlić

2014

Ann. Data. Sci.

Self Cite

View full text Add to dashboard Cite

The Service Oriented Approach (SOA) is based on the idea that distributed applications can be flexibly composed by integrating independently developed component services. Due to the fact that a large number of available services offer similar functionality, when choosing actual services to be included in the composition their non-functional (Quality of Service -QoS) properties must also be taken into account. On the other hand certain constraints regarding the required performances (i.e. the required QoS levels) may also be given. Therefore, web service selection presents a multiple-objective multiple constraint problem and in this paper we model it as a discrete multiple-objective linear fractional programming (MOLFP) problem. In order to solve this problem we use a previously published technique for generating strongly efficient solutions to a continuous MOLFP problem to the discrete case. We present a complete methodology for solving the multiple criteria web service selection problem and report the experimental results obtained by testing it on 50 random instances generated by varying the input parameters.

show abstract

“…is a strongly efficient solution to Problem (6)- (7). Otherwise, set x * = x h , h = h + 1 and go to Step 2.…”

Section: Solving the Web Service Selection Problemmentioning

confidence: 99%

Section: Solving the Web Service Selection Problemmentioning

confidence: 99%

Section: Solving the Web Service Selection Problemmentioning

confidence: 99%

Section: Solving the Web Service Selection Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Optimization of Multiple-Objective Web Service Selection Using Fractional Programming

Stanojević

Turajlić

2014

Ann. Data. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

A note on ‘Taylor series approach to fuzzy multiple objective linear fractional programming’

Stanojević

2013

Information Sciences

View full text Add to dashboard Cite

Finding a solution for Multi-Objective Linear Fractional Programming problem based on goal programming and Data Envelopment Analysis

et al. 2017

View full text Add to dashboard Cite

The multi-objective linear fractional programming is an interesting topic with many applications in different fields. Until now, various algorithms have been proposed in order to solve the multi-objective linear fractional programming (MOLFP) problem. An important point in most of them is the use of non-linear programming with a high computational complexity or the use of linear programming with preferences of the objective functions which are assigned by the decision maker. The current paper, through combining goal programming and data envelopment analysis (DEA), proposes an iterative method to solve MOLFP problems using only linear programming. Moreover, the proposed method provides an efficient solution which fairly optimizes each objective function when the decision maker has no information about the preferences of the objective functions. In fact, along with normalization of the objective functions, their relative preferences are fairly determined using the DEA. The implementation of the proposed method is demonstrated using numerical examples.

show abstract

On the efficiency test in multi-objective linear fractional programming problems by Lotfi et al. 2010

Cited by 9 publications

References 10 publications

Optimization of Multiple-Objective Web Service Selection Using Fractional Programming

Optimization of Multiple-Objective Web Service Selection Using Fractional Programming

A note on ‘Taylor series approach to fuzzy multiple objective linear fractional programming’

Finding a solution for Multi-Objective Linear Fractional Programming problem based on goal programming and Data Envelopment Analysis

Contact Info

Product

Resources

About