To overcome the defects that traditional approach for multi-objective programming under uncertain random environment (URMOP) neglects randomness and uncertainty of problem volatility results, a new is proposed based on expected value-standard deviation value criterion (C ESD criterion). Firstly,...

delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

data envelopment analysis (dea) is a method to evaluate the relative efficiency of decision making units (dmus). in this method, the issue has always been to determine a set of weights for each dmu which often caused many problems. since the dea models also have the multi-objective linear programming (molp) problems nature, a rational relationship can be established between molp and dea problem...

Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...

Receiver operating characteristic (ROC) is usually used to analyse the performance of classifiers in data mining. An important ROC analysis topic is ROC convex hull(ROCCH), which is the least convex majorant (LCM) of the empirical ROC curve, and covers potential optima for the given set of classifiers. Generally, ROC performance maximization could be considered to maximize the ROCCH, which also...

Abstract This paper addresses the problem of approximating set all solutions for Multi-objective Markov Decision Processes. We show that in vast majority interesting cases, number is exponential or even infinite. In order to overcome this difficulty we propose approximate by means a limited precision approach based on White’s multi-objective value-iteration dynamic programming algorithm. prove ...