TIES598 Nonlinear Multiobjective Optimization A priori and a posteriori methods spring 2017

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "TIES598 Nonlinear Multiobjective Optimization A priori and a posteriori methods spring 2017"

Transcription

1 TIES598 Nonlinear Multiobjective Optimization A priori and a posteriori methods spring 2017 Jussi Hakanen

2 Contents A priori methods A posteriori methods Some example methods

3 Learning outcomes To understand different approaches of solving multiobjective optimization problems To understand differences between a priori and a posteriori approaches To be able to apply the methods presented in solving multiobjective optimization problems

4 Reminder: Pareto optimality All the objectives don t have the same optimal solution optimality needs to be modified Pareto optimality (PO) A solution is Pareto optimal if none of the objectives can be improved without impairing at least one of the others

5 Weak Pareto optimality Pareto optimality can be difficult to guarantee Weak PO: Some objective can be improved without worsening others PO solution is also weakly PO PO solutions are better but more difficult to compute than weakly PO ones f 2 Weakly PO solutions f 1

6 Reminder: Solution approaches Plenty of methods developed for MOO We concentrate on methods that aim at finding the most preferred PO solution MOO methods can de categorized based on the role of DM No-preference methods (no DM) A priori methods A posteriori methods Interactive methods

7 Properties of a good MOO method Methods based on scalarization produce usually one solution at a time Good method should have the following properties produce (weakly) PO solutions is able to find any (weakly) PO solution (by using suitable parameters of the method) parameters should be meaningful for the DM

8 Normalization of objectives In many of the methods, the normalization of the objectives is necessary If very different scales, then small changes for higher scale objectives can dominate large changes for objectives with smaller scale We can normalize the objectives using the nadir and ideal and setting the normalized objective as ሚf i x = f i x z i z i nad z i There exist other ways of normalization as well

9 Calculating ideal and nadir Ideal objective vector z R k : best values for each objective when optimized independently z i = min x S f i (x) Nadir objective vector z nad R k : worst values for each objective within Pareto front z i nad = max f x Pareto front f i (x) Easy to obtain for bi-objective problems Estimation required for k > 3 Pay-off table: nadir value the worst in each column f 1 f 2 f k f 1 f 1 (x,1 ) f 2 (x,1 ) f k (x,1 ) f 2 f 1 (x,2 ) f 2 (x,2 ) f 2 (x,2 ) f k (x,1 ) f 1 (x,k ) f 2 (x,k ) f k (x,k ) x,i = optimal solution for f i Ideal values

10 No-preference methods No DM/preferences available E.g. online optimization Idea: compute some PO solution E.g. closest PO solution to the ideal objective vector Benefits Easy to implement and fast to solve No communication with DM needed(?) Drawbacks No way to influence what kind of PO solution is obtained Problem characteristics not taken into account

11 Method of global criterion min x S k i=1 f i x z i p 1/p Z = f(s) Distance to the ideal objective vector is minimized A single objective optimization problem is solved Different metrics can be used, e.g. L p metric where 1 p If p <, the solution obtained is PO If p =, the solution obtained is weakly PO f 2 z :ideal objective vector f 1 L 1 metric L 2 metric L metric

12 A priori methods Ask preferences from DM Idea: 1) ask preferences, 2) optimize Only such PO solution is produced that is of interest to the DM Benefits Computed PO solutions are based on the preferences of the DM (no unnecessary solutions) Drawbacks May be difficult for DM to express preferences before seeing any PO solutions Compute PO solution accordingly

13 A posteriori methods Idea: 1) optimize, 2) DM makes decision Approximation of Pareto front (or part of it) E.g. evolutionary multiobjective optimization methods Benefits Well suited for 2 objectives PO solutions easy to visualize Understanding of the whole Pareto front Drawbacks Approximating Pareto front often time consuming DM has to choose among large number of solutions Visualization for high number of objectives Compute different PO solutions Ask DM to select most preferred one

14 Weighting method where σk i=1 min σ k x S i=1 w i f i (x), w i = 1, w i 0, i = 1,, k Weighted sum of the objectives is optimized Different PO solutions can be obtained by changing the weights w i Either a priori or a posteriori method One of the most well-known methods Gass & Saaty (Naval Research Logistics,1955), Zadeh (IEEE Transactions on Automatic Control, 1963)

15 Weighting method Benefits Solution obtained with positive weights is PO Easy to solve (simple objective function, no additional constraints) Drawbacks Can t find all PO solutions (only for convex problems) PO solution obtained does not necessarily reflect the preferences

16 Example of proving Pareto optimality Show that the solution of k min σ i=1 w i f i (x) s. t. x S, is Pareto optimal when w i > 0 for all i (w i 0, i = 1,, k and σk i=1 w i = 1)

17 Example Where to go for a vacation (adopted from Emeritus Prof. Pekka Korhonen) Price Hiking Fishing Surfing Max A ,4 B C ,6 weight 0,4 0,2 0,2 0,2 The place with the best value for the most important objective function has the worst total score! Compromise B can t be optimal for any weights 0,5 for price and 0,167 for others: A and C both get the best score 0,6 for price and 0,133 for others: C will get the best score

18 Convex / non-convex Pareto front Weights = slope of the level set of the objective function Slope changes by changing the weights Non-convex part can t be reached with any weights! f 2, min w 1 =0.5, w 2 =0.5 w 1 =1/3, w 2 =2/3 f 2, min convex Pareto front f 1, min non-convex Pareto front f 1, min

19 ε-constraint method min x S f j(x) s. t. f i x ε i, i j Choose one objective to be optimized, give others an upper bound and consider as constraints Different PO solutions can be obtained by changing the bounds and/or the objective to be optimized Either a priori or a posteriori method Haimes, Lasdon & Wismer (IEEE Transactions on Systems, Man and Cybernetics, 1971)

20 From Miettinen: Nonlinear optimization, 2007 (in Finnish) Example PO solutions for different upper bounds for f 2 ε 1 no solutions ε 2 z 2 ε 3 z 3 ε 4 z 4 f 2 f 1

21 ε-constraint method Benefits Every PO solution can be found* Solution is weakly PO (unique solution is PO) Easy to implement Drawbacks How to choose upper bounds? Does not necessarily give feasible solutions How to adjust the bounds How to choose the objective to be optimized? Scalability for high number of objectives * A solution x S is PO if and only if it is the solution given by the ε-constraint method for every j = 1,, k where ε i = f i x, i j

22 Reference point method Based on a reference point തz given by DM Different PO solutions are obtained by changing the reference point Satisficing vs optimal decision making Wierzbicki (In: Multiple Criteria Decision Making, Theory and Applications, 1980)

23 Reference point method min x S max w i(f i x z i ҧ ) + ρ i=1,,k Reference point തz = z 1 ҧ,, ҧ Consists of aspiration levels for the objectives Can be feasible or not Weights w = w 1,, w T k, w i 0 Used for normalizing objectives, are not coming from DM Augmentation term guarantees Pareto optimality Small ρ > 0, typically of the order 10 3 Solution is weakly PO without the augmentation term z k T k i=1 w i (f i x z i ҧ )

24 Effect of the weights f 2, min Z = f(s) nad z Z = f(s): image of the feasible region z : ideal objective vector z nad : nadir objective vector തz 1, തz 2 : reference points z 2 w i 1 z i nad z i * w i 1 z i z i * w i 1 z i nad z i * z 1 z f 1, min Different weights can produce different PO solutions for the same reference point

25 Reference point method Benefits Produces only PO solutions (when augmentation term included) Every PO solution can be obtained Reference point is an intuitive way to express preferences Drawbacks Aspiration level needs to be given for all objectives No support for specifying the levels

26 More information V. Changkong & Y. Haimes, Multiobjective Decision Making: Theory and Methodology, 1983 Y. Sawaragi, H. Nakayama & T. Tanino, Theory of Multiobjective Optimization, 1985 R.E. Steuer, Multiple Criteria Optimization: Theory, Computation and Applications, 1986 K. Miettinen, Nonlinear Multiobjective Optimization, 1999 M. Ehrgott, Multicriteria Optimization, 2005 K. Miettinen, Introduction to Multiobjective Optimization: Noninteractive Approaches, In: J. Branke, K. Deb, K. Miettinen & R. Slowinski (eds): Multiobjective Optimization: Interactive and Evolutionary Approaches, 2008

27 Material for discussion on March 30th I. Das & J. Dennis, Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems, SIAM Journal on Optimization, 1998, 8, M. Tamiz, D. Jones & C. Romero, Goal programming for decision making: An overview of the current state-of-the-art, European Journal of Operational Research, 1998, 111,

Multiobjective optimization methods

Multiobjective optimization methods Multiobjective optimization methods Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi spring 2014 TIES483 Nonlinear optimization No-preference methods DM not available (e.g. online optimization)

More information

A NONLINEAR WEIGHTS SELECTION IN WEIGHTED SUM FOR CONVEX MULTIOBJECTIVE OPTIMIZATION. Abimbola M. Jubril. 1. Introduction

A NONLINEAR WEIGHTS SELECTION IN WEIGHTED SUM FOR CONVEX MULTIOBJECTIVE OPTIMIZATION. Abimbola M. Jubril. 1. Introduction FACTA UNIVERSITATIS (NIŠ) Ser. Math. Inform. Vol. 27 No 3 (12), 37 372 A NONLINEAR WEIGHTS SELECTION IN WEIGHTED SUM FOR CONVEX MULTIOBJECTIVE OPTIMIZATION Abimbola M. Jubril Abstract. The weighted sum

More information

Synchronous Usage of Parameterized Achievement Scalarizing Functions in Interactive Compromise Programming

Synchronous Usage of Parameterized Achievement Scalarizing Functions in Interactive Compromise Programming Synchronous Usage of Parameterized Achievement Scalarizing Functions in Interactive Compromise Programming Yury Nikulin and Volha Karelkina University of Turku, Department of Mathematics and Statistics

More information

Multiple Criteria Optimization: Some Introductory Topics

Multiple Criteria Optimization: Some Introductory Topics Multiple Criteria Optimization: Some Introductory Topics Ralph E. Steuer Department of Banking & Finance University of Georgia Athens, Georgia 30602-6253 USA Finland 2010 1 rsteuer@uga.edu Finland 2010

More information

Experiments with classification-based scalarizing functions in interactive multiobjective optimization

Experiments with classification-based scalarizing functions in interactive multiobjective optimization European Journal of Operational Research 175 (2006) 931 947 Decision Support Experiments with classification-based scalarizing functions in interactive multiobjective optimization Kaisa Miettinen a, *,

More information

Approximation Method for Computationally Expensive Nonconvex Multiobjective Optimization Problems

Approximation Method for Computationally Expensive Nonconvex Multiobjective Optimization Problems JYVÄSKYLÄ STUDIES IN COMPUTING 157 Tomi Haanpää Approximation Method for Computationally Expensive Nonconvex Multiobjective Optimization Problems JYVÄSKYLÄ STUDIES IN COMPUTING 157 Tomi Haanpää Approximation

More information

XIII Simpósio Brasileiro de Automação Inteligente Porto Alegre RS, 1 o 4 de Outubro de 2017

XIII Simpósio Brasileiro de Automação Inteligente Porto Alegre RS, 1 o 4 de Outubro de 2017 PARETO FRONT ANALYSIS OF CONTROL STRUCTURES IN MULTIMODEL SYSTEMS: THE WORK SCENARIO CONCEPT INTRODUCTION. Gilberto Reynoso-Meza, Jesús Carrillo-Ahumada, Leonardi Martín Torralba Morales Industrial and

More information

A Brief Introduction to Multiobjective Optimization Techniques

A Brief Introduction to Multiobjective Optimization Techniques Università di Catania Dipartimento di Ingegneria Informatica e delle Telecomunicazioni A Brief Introduction to Multiobjective Optimization Techniques Maurizio Palesi Maurizio Palesi [mpalesi@diit.unict.it]

More information

Local Approximation of the Efficient Frontier in Robust Design

Local Approximation of the Efficient Frontier in Robust Design Local Approximation of the Efficient Frontier in Robust Design Jinhuan Zhang, Graduate Assistant Department of Mechanical Engineering Clemson University Margaret M. Wiecek, Associate Professor Department

More information

Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms

Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms Tadahiko Murata 1, Shiori Kaige 2, and Hisao Ishibuchi 2 1 Department of Informatics, Kansai University 2-1-1 Ryozenji-cho,

More information

Constrained optimization: direct methods (cont.)

Constrained optimization: direct methods (cont.) Constrained optimization: direct methods (cont.) Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi Direct methods Also known as methods of feasible directions Idea in a point x h, generate a

More information

FRIEDRICH-ALEXANDER-UNIVERSITÄT ERLANGEN-NÜRNBERG INSTITUT FÜR ANGEWANDTE MATHEMATIK

FRIEDRICH-ALEXANDER-UNIVERSITÄT ERLANGEN-NÜRNBERG INSTITUT FÜR ANGEWANDTE MATHEMATIK FRIEDRICH-ALEXANDER-UNIVERSITÄT ERLANGEN-NÜRNBERG INSTITUT FÜR ANGEWANDTE MATHEMATIK Scalarizations For Adaptively Solving Multi-Objective Optimization Problems by G. Eichfelder No. 3 2006 Institut für

More information

USING LEXICOGRAPHIC PARAMETRIC PROGRAMMING FOR IDENTIFYING EFFICIENT UNITS IN DEA

USING LEXICOGRAPHIC PARAMETRIC PROGRAMMING FOR IDENTIFYING EFFICIENT UNITS IN DEA Pekka J. Korhonen Pyry-Antti Siitari USING LEXICOGRAPHIC PARAMETRIC PROGRAMMING FOR IDENTIFYING EFFICIENT UNITS IN DEA HELSINKI SCHOOL OF ECONOMICS WORKING PAPERS W-381 Pekka J. Korhonen Pyry-Antti Siitari

More information

Performance Assessment of Generalized Differential Evolution 3 with a Given Set of Constrained Multi-Objective Test Problems

Performance Assessment of Generalized Differential Evolution 3 with a Given Set of Constrained Multi-Objective Test Problems Performance Assessment of Generalized Differential Evolution 3 with a Given Set of Constrained Multi-Objective Test Problems Saku Kukkonen, Student Member, IEEE and Jouni Lampinen Abstract This paper presents

More information

Approximating Pareto Curves using Semidefinite Relaxations

Approximating Pareto Curves using Semidefinite Relaxations Approximating Pareto Curves using Semidefinite Relaxations Victor Magron, Didier Henrion,,3 Jean-Bernard Lasserre, arxiv:44.477v [math.oc] 6 Jun 4 June 7, 4 Abstract We consider the problem of constructing

More information

Approaches to Sensitivity Analysis in MOLP

Approaches to Sensitivity Analysis in MOLP I.J. Information echnology and Computer Science, 204, 03, 54-60 Published Online February 204 in MECS (http://www.mecs-press.org/) DOI: 0.585/ijitcs.204.03.07 Approaches to Sensitivity Analysis in MOLP

More information

The Edgeworth-Pareto Principle in Decision Making

The Edgeworth-Pareto Principle in Decision Making The Edgeworth-Pareto Principle in Decision Making Vladimir D. Noghin Saint-Petersburg State University Russia URL: www.apmath.spbu.ru/staff/noghin dgmo-2006 Introduction Since the 19 century, the Edgeworth-Pareto

More information

An Evaluation Framework for the Comparison of Fine-Grained Predictive Models in Health Care

An Evaluation Framework for the Comparison of Fine-Grained Predictive Models in Health Care An Evaluation Framework for the Comparison of Fine-Grained Predictive Models in Health Care Ward R.J. van Breda 1 ), Mark Hoogendoorn 1,A.E.Eiben 1, and Matthias Berking 2 1 VU University Amsterdam, Department

More information

A Note on Robustness of the Min-Max Solution to Multiobjective Linear Programs

A Note on Robustness of the Min-Max Solution to Multiobjective Linear Programs A Note on Robustness of the Min-Max Solution to Multiobjective Linear Programs Erin K. Doolittle, Karyn Muir, and Margaret M. Wiecek Department of Mathematical Sciences Clemson University Clemson, SC January

More information

GDE3: The third Evolution Step of Generalized Differential Evolution

GDE3: The third Evolution Step of Generalized Differential Evolution GDE3: The third Evolution Step of Generalized Differential Evolution Saku Kukkonen Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute of Technology Kanpur Kanpur, PIN 28 16, India saku@iitk.ac.in,

More information

Advances in the Use of MCDA Methods in Decision-Making

Advances in the Use of MCDA Methods in Decision-Making Advances in the Use of MCDA Methods in Decision-Making JOSÉ RUI FIGUEIRA CEG-IST, Center for Management Studies, Instituto Superior Técnico, Lisbon LAMSADE, Université Paris-Dauphine (E-mail : figueira@ist.utl.pt)

More information

Dual methods and ADMM. Barnabas Poczos & Ryan Tibshirani Convex Optimization /36-725

Dual methods and ADMM. Barnabas Poczos & Ryan Tibshirani Convex Optimization /36-725 Dual methods and ADMM Barnabas Poczos & Ryan Tibshirani Convex Optimization 10-725/36-725 1 Given f : R n R, the function is called its conjugate Recall conjugate functions f (y) = max x R n yt x f(x)

More information

DESIGN OF OPTIMAL LINEAR SYSTEMS BY MULTIPLE OBJECTIVES

DESIGN OF OPTIMAL LINEAR SYSTEMS BY MULTIPLE OBJECTIVES etr Fiala ESIGN OF OTIMAL LINEAR SYSTEMS Y MULTILE OJECTIVES Abstract Traditional concepts of optimality focus on valuation of already given systems. A new concept of designing optimal systems is proposed.

More information

Crowdsourcing Pareto-Optimal Object Finding by Pairwise Comparisons

Crowdsourcing Pareto-Optimal Object Finding by Pairwise Comparisons 2015 The University of Texas at Arlington. All Rights Reserved. Crowdsourcing Pareto-Optimal Object Finding by Pairwise Comparisons Abolfazl Asudeh, Gensheng Zhang, Naeemul Hassan, Chengkai Li, Gergely

More information

Minimax reference point approach and its application for multiobjective optimisation

Minimax reference point approach and its application for multiobjective optimisation European Journal of Operational Research 126 (2000) 541±556 www.elsevier.com/locate/dsw Theory and Methodology Minimax reference point approach and its application for multiobjective optimisation Jian-Bo

More information

Ensemble determination using the TOPSIS decision support system in multi-objective evolutionary neural network classifiers

Ensemble determination using the TOPSIS decision support system in multi-objective evolutionary neural network classifiers Ensemble determination using the TOPSIS decision support system in multi-obective evolutionary neural network classifiers M. Cruz-Ramírez, J.C. Fernández, J. Sánchez-Monedero, F. Fernández-Navarro, C.

More information

Pareto Set Analysis: Local Measures of Objective Coupling in Multi-objective Design Optimization

Pareto Set Analysis: Local Measures of Objective Coupling in Multi-objective Design Optimization 8 th World Congress on Structural and Multidisciplinary Optimization June -5, 009, Lisbon, Portugal Pareto Set Analysis: Local Measures of Objective Coupling in Multi-objective Design Optimization Bart

More information

Robust Solutions to Multi-Objective Linear Programs with Uncertain Data

Robust Solutions to Multi-Objective Linear Programs with Uncertain Data Robust Solutions to Multi-Objective Linear Programs with Uncertain Data arxiv:1402.3095v1 [math.oc] 13 Feb 2014 M.A. Goberna, V. Jeyakumar, G. Li, and J. Vicente-Pérez December 9, 2013 Abstract In this

More information

A Bicriteria Approach to Robust Optimization

A Bicriteria Approach to Robust Optimization A Bicriteria Approach to Robust Optimization André Chassein and Marc Goerigk Fachbereich Mathematik, Technische Universität Kaiserslautern, Germany Abstract The classic approach in robust optimization

More information

ON THE LINEAR WEIGHTED SUM METHOD FOR MULTI-OBJECTIVE OPTIMIZATION. Ivan P. Stanimirović, Milan Lj. Zlatanović, Marko D. Petković. 1.

ON THE LINEAR WEIGHTED SUM METHOD FOR MULTI-OBJECTIVE OPTIMIZATION. Ivan P. Stanimirović, Milan Lj. Zlatanović, Marko D. Petković. 1. FACTA UNIVERSITATIS (NIŠ) SER. MATH. INFORM. 26 (2011), 49 63 ON THE LINEAR WEIGHTED SUM METHOD FOR MULTI-OBJECTIVE OPTIMIZATION Ivan P. Stanimirović, Milan Lj. Zlatanović, Marko D. Petković Abstract.

More information

Classification and Regression Trees

Classification and Regression Trees Classification and Regression Trees Ryan P Adams So far, we have primarily examined linear classifiers and regressors, and considered several different ways to train them When we ve found the linearity

More information

An Empirical Study of Control Parameters for Generalized Differential Evolution

An Empirical Study of Control Parameters for Generalized Differential Evolution An Empirical tudy of Control Parameters for Generalized Differential Evolution aku Kukkonen Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute of Technology Kanpur Kanpur, PIN 8 6, India saku@iitk.ac.in,

More information

Neural Network Identification of Non Linear Systems Using State Space Techniques.

Neural Network Identification of Non Linear Systems Using State Space Techniques. Neural Network Identification of Non Linear Systems Using State Space Techniques. Joan Codina, J. Carlos Aguado, Josep M. Fuertes. Automatic Control and Computer Engineering Department Universitat Politècnica

More information

Min-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty

Min-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty Min-- Robust Combinatorial Optimization Subject to Discrete Uncertainty Christoph Buchheim Jannis Kurtz Received: date / Accepted: date Abstract We consider combinatorial optimization problems with uncertain

More information

Constrained Real-Parameter Optimization with Generalized Differential Evolution

Constrained Real-Parameter Optimization with Generalized Differential Evolution 2006 IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, 2006 Constrained Real-Parameter Optimization with Generalized Differential Evolution

More information

Multicriteria airport gate assignment and Pareto simulated annealing

Multicriteria airport gate assignment and Pareto simulated annealing IIE Transactions ISSN: 0740-817X (Print) 1545-880 (Online) Journal homepage: http://www.tandfonline.com/loi/uiie0 Multicriteria airport gate assignment and Pareto simulated annealing Andreas Drexl & Yury

More information

On the Existence of Ideal Solutions in Multi-objective 0-1 Integer Programs

On the Existence of Ideal Solutions in Multi-objective 0-1 Integer Programs On the Existence of Ideal Solutions in Multi-objective -1 Integer Programs Natashia Boland a, Hadi Charkhgard b, and Martin Savelsbergh a a School of Industrial and Systems Engineering, Georgia Institute

More information

Efficiency-Revenue Trade-offs in Auctions

Efficiency-Revenue Trade-offs in Auctions Efficiency-Revenue Trade-offs in Auctions Ilias Diakonikolas 1, Christos Papadimitriou 1, George Pierrakos 1, and Yaron Singer 2 1 UC Berkeley, EECS, {ilias,christos,georgios}@cs.berkeley.edu 2 Google,

More information

This is an electronic reprint of the original article. This reprint may differ from the original in pagination and typographic detail.

This is an electronic reprint of the original article. This reprint may differ from the original in pagination and typographic detail. This is an electronic reprint of the original article. This reprint may differ from the original in pagination and typographic detail. Author(s): Sindhya, Karthik; Ruuska, Sauli; Haanpää, Tomi; Miettinen,

More information

Chapter 4. Systems of Linear Equations; Matrices. Opening Example. Section 1 Review: Systems of Linear Equations in Two Variables

Chapter 4. Systems of Linear Equations; Matrices. Opening Example. Section 1 Review: Systems of Linear Equations in Two Variables Chapter 4 Systems of Linear Equations; Matrices Section 1 Review: Systems of Linear Equations in Two Variables Opening Example A restaurant serves two types of fish dinners- small for $5.99 and large for

More information

A New Approach for Solving Dual Fuzzy Nonlinear Equations Using Broyden's and Newton's Methods

A New Approach for Solving Dual Fuzzy Nonlinear Equations Using Broyden's and Newton's Methods From the SelectedWorks of Dr. Mohamed Waziri Yusuf August 24, 22 A New Approach for Solving Dual Fuzzy Nonlinear Equations Using Broyden's and Newton's Methods Mohammed Waziri Yusuf, Dr. Available at:

More information

On Computing the Worst-case Performance of Lur'e Systems with Uncertain Time-invariant Delays

On Computing the Worst-case Performance of Lur'e Systems with Uncertain Time-invariant Delays Article On Computing the Worst-case Performance of Lur'e Systems with Uncertain Time-invariant Delays Thapana Nampradit and David Banjerdpongchai* Department of Electrical Engineering, Faculty of Engineering,

More information

arxiv: v2 [cs.sy] 29 Mar 2016

arxiv: v2 [cs.sy] 29 Mar 2016 Approximate Dynamic Programming: a Q-Function Approach Paul Beuchat, Angelos Georghiou and John Lygeros 1 ariv:1602.07273v2 [cs.sy] 29 Mar 2016 Abstract In this paper we study both the value function and

More information

Solving Multi-Criteria Optimization Problems with Population-Based ACO

Solving Multi-Criteria Optimization Problems with Population-Based ACO Solving Multi-Criteria Optimization Problems with Population-Based ACO Michael Guntsch 1 and Martin Middendorf 2 1 Institute for Applied Computer Science and Formal Description Methods University of Karlsruhe,

More information

Feature Selection with Fuzzy Decision Reducts

Feature Selection with Fuzzy Decision Reducts Feature Selection with Fuzzy Decision Reducts Chris Cornelis 1, Germán Hurtado Martín 1,2, Richard Jensen 3, and Dominik Ślȩzak4 1 Dept. of Mathematics and Computer Science, Ghent University, Gent, Belgium

More information

Online Learning, Mistake Bounds, Perceptron Algorithm

Online Learning, Mistake Bounds, Perceptron Algorithm Online Learning, Mistake Bounds, Perceptron Algorithm 1 Online Learning So far the focus of the course has been on batch learning, where algorithms are presented with a sample of training data, from which

More information

Lower Semicontinuity of the Efficient Solution Mapping in Semi-Infinite Vector Optimization

Lower Semicontinuity of the Efficient Solution Mapping in Semi-Infinite Vector Optimization J Syst Sci Complex (015) 8: 131 135 Lower Semicontinuity of the Efficient Solution Mapping in Semi-Infinite Vector Optimization GONG Xunhua DOI: 10.1007/s1144-015-3058-8 Received: 1 March 013 c The Editorial

More information

WEIGHTING MATRICES DETERMINATION USING POLE PLACEMENT FOR TRACKING MANEUVERS

WEIGHTING MATRICES DETERMINATION USING POLE PLACEMENT FOR TRACKING MANEUVERS U.P.B. Sci. Bull., Series D, Vol. 75, Iss. 2, 2013 ISSN 1454-2358 WEIGHTING MATRICES DETERMINATION USING POLE PLACEMENT FOR TRACKING MANEUVERS Raluca M. STEFANESCU 1, Claudiu L. PRIOROC 2, Adrian M. STOICA

More information

OPERATIONS RESEARCH. Linear Programming Problem

OPERATIONS RESEARCH. Linear Programming Problem OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com MODULE - 2: Simplex Method for

More information

Multitask Learning of Environmental Spatial Data

Multitask Learning of Environmental Spatial Data 9th International Congress on Environmental Modelling and Software Brigham Young University BYU ScholarsArchive 6th International Congress on Environmental Modelling and Software - Leipzig, Germany - July

More information

Group Decision Making Using Comparative Linguistic Expression Based on Hesitant Intuitionistic Fuzzy Sets

Group Decision Making Using Comparative Linguistic Expression Based on Hesitant Intuitionistic Fuzzy Sets Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 932-9466 Vol. 0, Issue 2 December 205), pp. 082 092 Applications and Applied Mathematics: An International Journal AAM) Group Decision Making Using

More information

Computational Intelligence Lecture 3: Simple Neural Networks for Pattern Classification

Computational Intelligence Lecture 3: Simple Neural Networks for Pattern Classification Computational Intelligence Lecture 3: Simple Neural Networks for Pattern Classification Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2011 arzaneh Abdollahi

More information

Column Generation in Integer Programming with Applications in Multicriteria Optimization

Column Generation in Integer Programming with Applications in Multicriteria Optimization Column Generation in Integer Programming with Applications in Multicriteria Optimization Matthias Ehrgott Department of Engineering Science The University of Auckland, New Zealand email: m.ehrgott@auckland.ac.nz

More information

EE C128 / ME C134 Feedback Control Systems

EE C128 / ME C134 Feedback Control Systems EE C128 / ME C134 Feedback Control Systems Lecture Additional Material Introduction to Model Predictive Control Maximilian Balandat Department of Electrical Engineering & Computer Science University of

More information

While using the input and output data fu(t)g and fy(t)g, by the methods in system identification, we can get a black-box model like (In the case where

While using the input and output data fu(t)g and fy(t)g, by the methods in system identification, we can get a black-box model like (In the case where ESTIMATE PHYSICAL PARAMETERS BY BLACK-BOX MODELING Liang-Liang Xie Λ;1 and Lennart Ljung ΛΛ Λ Institute of Systems Science, Chinese Academy of Sciences, 100080, Beijing, China ΛΛ Department of Electrical

More information

Eliciting Consumer Preferences using Robust Adaptive Choice Questionnaires

Eliciting Consumer Preferences using Robust Adaptive Choice Questionnaires Eliciting Consumer Preferences using Robust Adaptive Choice Questionnaires JACOB ABERNETHY, THEODOROS EVGENIOU, OLIVIER TOUBIA, and JEAN-PHILIPPE VERT 1 1 Jacob Abernethy is a graduate student at Toyota

More information

Systems of Linear Equations in Two Variables. Break Even. Example. 240x x This is when total cost equals total revenue.

Systems of Linear Equations in Two Variables. Break Even. Example. 240x x This is when total cost equals total revenue. Systems of Linear Equations in Two Variables 1 Break Even This is when total cost equals total revenue C(x) = R(x) A company breaks even when the profit is zero P(x) = R(x) C(x) = 0 2 R x 565x C x 6000

More information

A Discrete Robust Adaptive Iterative Learning Control for a Class of Nonlinear Systems with Unknown Control Direction

A Discrete Robust Adaptive Iterative Learning Control for a Class of Nonlinear Systems with Unknown Control Direction Proceedings of the International MultiConference of Engineers and Computer Scientists 16 Vol I, IMECS 16, March 16-18, 16, Hong Kong A Discrete Robust Adaptive Iterative Learning Control for a Class of

More information

Structural Dynamics and Materials Conference, Lake Tahoe, Nevada, May 2{

Structural Dynamics and Materials Conference, Lake Tahoe, Nevada, May 2{ [15] Jaroslaw Sobieszczanski-Sobieski, Benjamin James, and Augustine Dovi. Structural optimization by multilevel decomposition. In Proceedings of the AIAA/ASME/ASCE/AHS 24th Structures, Structural Dynamics

More information

IEEE TRANSACTIONS ON POWER SYSTEMS 1

IEEE TRANSACTIONS ON POWER SYSTEMS 1 TRANSACTIONS ON POWER SYSTEMS 1 Solving Multi-Objective Economic Dispatch Problem Via Semidefinite Programming Abimbola M Jubril, Member,, Olusola A Komolafe, Member,, and Kehinde O Alawode, Student Member,

More information

Optimizare multiobiectiv utilizand algoritmi genetici. Multiobjective optimization using genetic algorithms

Optimizare multiobiectiv utilizand algoritmi genetici. Multiobjective optimization using genetic algorithms Optimizare multiobiectiv utilizand algoritmi genetici Multiobjective optimization using genetic algorithms Multiobjective Optimization (MOO) Find x x, 1 x, 2..., x T N that minimizes {f 1 (x), f 2 (x),,

More information

Design Aspects of High-Field Block-Coil Superconducting Dipole Magnets

Design Aspects of High-Field Block-Coil Superconducting Dipole Magnets Design Aspects of High-Field Block-Coil Superconducting Dipole Magnets E. I. Sfakianakis August 31, 2006 Abstract Even before the construction of the Large Hadron Collider at CERN is finished, ideas about

More information

Presentation for CSG399 By Jian Wen

Presentation for CSG399 By Jian Wen Presentation for CSG399 By Jian Wen Outline Skyline Definition and properties Related problems Progressive Algorithms Analysis SFS Analysis Algorithm Cost Estimate Epsilon Skyline(overview and idea) Skyline

More information

Pattern Recognition 2

Pattern Recognition 2 Pattern Recognition 2 KNN,, Dr. Terence Sim School of Computing National University of Singapore Outline 1 2 3 4 5 Outline 1 2 3 4 5 The Bayes Classifier is theoretically optimum. That is, prob. of error

More information

Introduction to General Equilibrium

Introduction to General Equilibrium Introduction to General Equilibrium Juan Manuel Puerta November 6, 2009 Introduction So far we discussed markets in isolation. We studied the quantities and welfare that results under different assumptions

More information

TECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531

TECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 TECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence

More information

An Evaluation of the Reliability of Complex Systems Using Shadowed Sets and Fuzzy Lifetime Data

An Evaluation of the Reliability of Complex Systems Using Shadowed Sets and Fuzzy Lifetime Data International Journal of Automation and Computing 2 (2006) 145-150 An Evaluation of the Reliability of Complex Systems Using Shadowed Sets and Fuzzy Lifetime Data Olgierd Hryniewicz Systems Research Institute

More information

Area I: Contract Theory Question (Econ 206)

Area I: Contract Theory Question (Econ 206) Theory Field Exam Summer 2011 Instructions You must complete two of the four areas (the areas being (I) contract theory, (II) game theory A, (III) game theory B, and (IV) psychology & economics). Be sure

More information

Key Concepts: Economic Computation, Part III

Key Concepts: Economic Computation, Part III Key Concepts: Economic Computation, Part III Brent Hickman Summer, 8 1 Using Newton s Method to Find Roots of Real- Valued Functions The intuition behind Newton s method is that finding zeros of non-linear

More information

The weighted distance measure based method to neutrosophic multi-attribute group decision making

The weighted distance measure based method to neutrosophic multi-attribute group decision making The weighted distance measure based method to neutrosophic multi-attribute group decision making Chunfang Liu 1,2, YueSheng Luo 1,3 1 College of Science, Northeast Forestry University, 150040, Harbin,

More information

No-envy in Queueing Problems

No-envy in Queueing Problems No-envy in Queueing Problems Youngsub Chun School of Economics Seoul National University Seoul 151-742, Korea and Department of Economics University of Rochester Rochester, NY 14627, USA E-mail: ychun@plaza.snu.ac.kr

More information

Quiz Discussion. IE417: Nonlinear Programming: Lecture 12. Motivation. Why do we care? Jeff Linderoth. 16th March 2006

Quiz Discussion. IE417: Nonlinear Programming: Lecture 12. Motivation. Why do we care? Jeff Linderoth. 16th March 2006 Quiz Discussion IE417: Nonlinear Programming: Lecture 12 Jeff Linderoth Department of Industrial and Systems Engineering Lehigh University 16th March 2006 Motivation Why do we care? We are interested in

More information

Adaptive Dual Control

Adaptive Dual Control Adaptive Dual Control Björn Wittenmark Department of Automatic Control, Lund Institute of Technology Box 118, S-221 00 Lund, Sweden email: bjorn@control.lth.se Keywords: Dual control, stochastic control,

More information

Looking at Data Relationships. 2.1 Scatterplots W. H. Freeman and Company

Looking at Data Relationships. 2.1 Scatterplots W. H. Freeman and Company Looking at Data Relationships 2.1 Scatterplots 2012 W. H. Freeman and Company Here, we have two quantitative variables for each of 16 students. 1) How many beers they drank, and 2) Their blood alcohol

More information

Deposited on: 1 April 2009

Deposited on: 1 April 2009 Schütze, O. and Vasile, M. and Coello, C.A. (2008) Approximate solutions in space mission design. Lecture Notes in Computer Science, 5199. pp. 805-814. ISSN 0302-9743 http://eprints.gla.ac.uk/5049/ Deposited

More information

Semi-asynchronous Fault Diagnosis of Discrete Event Systems

Semi-asynchronous Fault Diagnosis of Discrete Event Systems 1 Semi-asynchronous Fault Diagnosis of Discrete Event Systems Alejandro White, Student Member, IEEE, Ali Karimoddini, Senior Member, IEEE Abstract This paper proposes a diagnostics tool for a Discrete-

More information

Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen. Bayesian Learning. Tobias Scheffer, Niels Landwehr

Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen. Bayesian Learning. Tobias Scheffer, Niels Landwehr Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen Bayesian Learning Tobias Scheffer, Niels Landwehr Remember: Normal Distribution Distribution over x. Density function with parameters

More information

MULTIOBJECTIVE optimization problems (MOPs),

MULTIOBJECTIVE optimization problems (MOPs), IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 18, NO. 6, DECEMBER 2014 909 Stable Matching-Based Selection in Evolutionary Multiobjective Optimization Ke Li, Student Member, IEEE, Qingfu Zhang, Senior

More information

A Comparison of Single- and Multi-Objective Programming Approaches to Problems with Multiple Design Objectives

A Comparison of Single- and Multi-Objective Programming Approaches to Problems with Multiple Design Objectives A Comparison of Single- and Multi-Objective Programming Approaches to Problems with Multiple Design Objectives Sibel Yaman and Chin-Hui Lee Abstract In this paper, we propose and compare single- and multi-objective

More information

The Simplex Method: An Example

The Simplex Method: An Example The Simplex Method: An Example Our first step is to introduce one more new variable, which we denote by z. The variable z is define to be equal to 4x 1 +3x 2. Doing this will allow us to have a unified

More information

PAijpam.eu OBTAINING A COMPROMISE SOLUTION OF A MULTI OBJECTIVE FIXED CHARGE PROBLEM IN A FUZZY ENVIRONMENT

PAijpam.eu OBTAINING A COMPROMISE SOLUTION OF A MULTI OBJECTIVE FIXED CHARGE PROBLEM IN A FUZZY ENVIRONMENT International Journal of Pure and Applied Mathematics Volume 98 No. 2 2015, 193-210 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v98i2.3

More information

Optimization and Complexity

Optimization and Complexity Optimization and Complexity Decision Systems Group Brigham and Women s Hospital, Harvard Medical School Harvard-MIT Division of Health Sciences and Technology Aim Give you an intuition of what is meant

More information

Smoothed Prediction of the Onset of Tree Stem Radius Increase Based on Temperature Patterns

Smoothed Prediction of the Onset of Tree Stem Radius Increase Based on Temperature Patterns Smoothed Prediction of the Onset of Tree Stem Radius Increase Based on Temperature Patterns Mikko Korpela 1 Harri Mäkinen 2 Mika Sulkava 1 Pekka Nöjd 2 Jaakko Hollmén 1 1 Helsinki

More information

Fuzzy Systems. Introduction

Fuzzy Systems. Introduction Fuzzy Systems Introduction Prof. Dr. Rudolf Kruse Christian Moewes {kruse,cmoewes}@iws.cs.uni-magdeburg.de Otto-von-Guericke University of Magdeburg Faculty of Computer Science Department of Knowledge

More information

Decision Analysis. An insightful study of the decision-making process under uncertainty and risk

Decision Analysis. An insightful study of the decision-making process under uncertainty and risk Decision Analysis An insightful study of the decision-making process under uncertainty and risk Decision Theory A philosophy, articulated by a set of logical axioms and a methodology, for analyzing the

More information

An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems

An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems Jörg Fliege February 25, 2004 Abstract In multicriteria optimization, several objective functions, conflicting with each

More information

Neutral Bayesian reference models for incidence rates of (rare) clinical events

Neutral Bayesian reference models for incidence rates of (rare) clinical events Neutral Bayesian reference models for incidence rates of (rare) clinical events Jouni Kerman Statistical Methodology, Novartis Pharma AG, Basel BAYES2012, May 10, Aachen Outline Motivation why reference

More information

Robust Observer for Uncertain T S model of a Synchronous Machine

Robust Observer for Uncertain T S model of a Synchronous Machine Recent Advances in Circuits Communications Signal Processing Robust Observer for Uncertain T S model of a Synchronous Machine OUAALINE Najat ELALAMI Noureddine Laboratory of Automation Computer Engineering

More information

Comparison between Interval and Fuzzy Load Flow Methods Considering Uncertainty

Comparison between Interval and Fuzzy Load Flow Methods Considering Uncertainty Comparison between Interval and Fuzzy Load Flow Methods Considering Uncertainty T.Srinivasarao, 2 P.Mallikarajunarao Department of Electrical Engineering, College of Engineering (A), Andhra University,

More information

Lecture 2: Linear regression

Lecture 2: Linear regression Lecture 2: Linear regression Roger Grosse 1 Introduction Let s ump right in and look at our first machine learning algorithm, linear regression. In regression, we are interested in predicting a scalar-valued

More information

Automatic Differentiation and Neural Networks

Automatic Differentiation and Neural Networks Statistical Machine Learning Notes 7 Automatic Differentiation and Neural Networks Instructor: Justin Domke 1 Introduction The name neural network is sometimes used to refer to many things (e.g. Hopfield

More information

Discriminant Correspondence Analysis

Discriminant Correspondence Analysis Discriminant Correspondence Analysis Hervé Abdi Overview As the name indicates, discriminant correspondence analysis (DCA) is an extension of discriminant analysis (DA) and correspondence analysis (CA).

More information

Shift Scheduling in Pediatric Emergency Medicine

Shift Scheduling in Pediatric Emergency Medicine Shift Scheduling in Pediatric Emergency Medicine Presenter : Young-Chae Hong M.S.E. Co-Authors : Amy Cohn, Ph.D. & Ed O'Brien M.D. University of Michigan INFOMS at San Francisco 11 / 10 / 2014 Collaborators

More information

The Naïve Bayes Classifier. Machine Learning Fall 2017

The Naïve Bayes Classifier. Machine Learning Fall 2017 The Naïve Bayes Classifier Machine Learning Fall 2017 1 Today s lecture The naïve Bayes Classifier Learning the naïve Bayes Classifier Practical concerns 2 Today s lecture The naïve Bayes Classifier Learning

More information

Lecture 04 Decision Making under Certainty: The Tradeoff Problem

Lecture 04 Decision Making under Certainty: The Tradeoff Problem Lecture 04 Decision Making under Certainty: The Tradeoff Problem Jitesh H. Panchal ME 597: Decision Making for Engineering Systems Design Design Engineering Lab @ Purdue (DELP) School of Mechanical Engineering

More information

Recurrent Latent Variable Networks for Session-Based Recommendation

Recurrent Latent Variable Networks for Session-Based Recommendation Recurrent Latent Variable Networks for Session-Based Recommendation Panayiotis Christodoulou Cyprus University of Technology paa.christodoulou@edu.cut.ac.cy 27/8/2017 Panayiotis Christodoulou (C.U.T.)

More information

Boosting: Foundations and Algorithms. Rob Schapire

Boosting: Foundations and Algorithms. Rob Schapire Boosting: Foundations and Algorithms Rob Schapire Example: Spam Filtering problem: filter out spam (junk email) gather large collection of examples of spam and non-spam: From: yoav@ucsd.edu Rob, can you

More information

MULTIPLEKERNELLEARNING CSE902

MULTIPLEKERNELLEARNING CSE902 MULTIPLEKERNELLEARNING CSE902 Multiple Kernel Learning -keywords Heterogeneous information fusion Feature selection Max-margin classification Multiple kernel learning MKL Convex optimization Kernel classification

More information

Chapter 2. Binary and M-ary Hypothesis Testing 2.1 Introduction (Levy 2.1)

Chapter 2. Binary and M-ary Hypothesis Testing 2.1 Introduction (Levy 2.1) Chapter 2. Binary and M-ary Hypothesis Testing 2.1 Introduction (Levy 2.1) Detection problems can usually be casted as binary or M-ary hypothesis testing problems. Applications: This chapter: Simple hypothesis

More information

The classifier. Theorem. where the min is over all possible classifiers. To calculate the Bayes classifier/bayes risk, we need to know

The classifier. Theorem. where the min is over all possible classifiers. To calculate the Bayes classifier/bayes risk, we need to know The Bayes classifier Theorem The classifier satisfies where the min is over all possible classifiers. To calculate the Bayes classifier/bayes risk, we need to know Alternatively, since the maximum it is

More information