Pareto-based techniques

These so-called Pareto-based techniques do not force consolidation over multiple criteria in advance and aim to return a representation of the set of optimal compounds. They support discussion between team members who may have different views on the downstream impacts of different risk factors perhaps, for example, one team member may know that there is a reliable biomarker for one potential side-effect. This would then mean that assessing this risk need not consume much development time and cost, and the risk factor can have a reduced weighting within the target product profile being evolved by the team. 

Population-based search techniques, such as evolutionary algorithms, are natural choices for Pareto-based methods because they work with a set of interim, approximate solutions on the way to an overall optimum. 

A Posteriori Methods Using Multi-Objective Approach (many based on evolutionary algorithms, simulated annealing, ant colony techniques etc.) These relatively recent methods have found many applications in chemical engineering. They provide many Pareto-optimal solutions and thus more information useful for decision making is available. Role of the DM is after finding optimal solutions, to review and select one of them. Many optimal solutions found will not be used for implementation, and so some may consider it as a waste of computational time. 

This procedure refers to the process by which buyers analyse their supply base and understand where the value and volume of activity occurs. This is often undertaken using Pareto techniques. The basic idea is to concentrate supplier development activities on the high value suppliers who manage most of the monetary value of the spend for the organisation. For the low value suppliers the normal aim is to drastically reduce the number of suppliers and transactions involved. 

A solution to the minimisation problem (3) is thus Pareto optimal if it is not dominated by any other feasible solution, and the non-dominated set of all Pareto optimal solutions is the Pareto front. Recent years have seen the development of a number of evolutionary techniques based on dominance measures for locating the Pareto front see [4, 6, 16] for recent reviews. 

Pareto-optimal solutions, but it essentially works by solving a set of NLPs by means of the SQP (Sequential Quadratic Programming), which is a gradient-based method. Thus, it can fail with non-convex problems. In order to improve the robustness of the technique, we have replaced the SQP solver by SRES. 

Pareto analysis A ranking technique based only on past data that identifies the most... 

---