Home
Poster (PDF)
 
Attendees
Conference program
Registration
Location
Hotel information
Links
 
 
Previous editions
2004
2003
2002


    

Session MA6 - Optimum de Pareto / Pareto Optimization

Day Monday, May 09, 2005
Location Marie-Husny
Chair Abdelmoutalib Metrane

Presentations

10h30 AM An Analysis of Sets of Pareto Optima
  Sheldon H. Jacobson, University of Illinois, Mech. & Ind. Eng., 1206 West Green Street (MC-244), Urbana, Illinois, USA, 61801-2906
Gio Kao, University of Illinois, Computer Science, Urbana, Illinois, USA, 61801

Given a large set of Pareto optima, it can be challenging to identify good solutions within this set. A discrete optimization problem is formulated to obtain such a set of good solutions. This problem’s complexity is discussed, as well as particular examples that illustrate the challenge when solving this problem.


10h55 AM Ranking by the Rough Approximation of a Preference Relation for an Extrusion Process
  Kazimierz Zaras, Université du Québec en Abitibi-Témiscamingue, Sciences de la gestion, 445, boulevard de l'Université, Rouyn-Noranda, Québec, CANADA, J9X 5E4
Laszlo Nandor Kiss, Université Laval, FSA, OSD, Sainte-Foy G1K 7P4, Québec, Canada, Québec, Québec, Canada, G1K 7P4
Christian Fonteix, Laboratoire des Sciences du Génie Chimique, UPR CNRS 6811, ENSIC, 1 rue Grandville, BP 451, F-540001 Nancy Cedex, France, Nancy, France, F-54001
Silvère Massebeuf, Laboratoire des Sciences du Génie Chimique, UPR CNRS 6811, ENSIC, 1 rue Grandville, BP 451, F-540001 Nancy Cedex, France, Nancy, France, F-54001

In this paper an extrusion process example is studied to illustrate a new methodology in the field if decision engineering, which is based on the Rough Set approach. Rough sets are used to aid to the Decision Maker in choosing the best point in the Pareto's region. The rough Set approach allows us to make a rough approximation of a preference relation on a simple of experomental points choosen from the Pareto set. These approximations are done to induce the decision rules, which can be afterwards applied on whole sets of potential points. To give the final recommendation the concept of technical robustness is suggested


11h20 AM Lower Semicontinuous Regularization for Vector-Valued Mappings
  Abdelmoutalib Metrane, École Polytechnique de Montréal, GERAD, 3000, chemin de la côte-Sainte-Catherine, Casier postal 37, Montréal, Québec, Canada, H3T 2AT
Mohamed Ait Mansour, Université de Limoges, LACO, Limoges, France
Michel Théra, Université de Limoges, LACO, 123, Avenue Albert Thomas 87060 Limoges Cedex FRANCE, Limoges, France

The concept of lower semicontinuity introduced for scalar functions by R. Baire has been recognized as a fundamental tool in different areas of mathematical analysis. It has been used in different contexts. The rapid development of optimization theory, in particular Pareto optimization, has made evident the necessity of extending this concept to vector-valued mappings. The main scope of this paper is then to define an appropriate lower semicontinuous regularization for vector-valued.