Approximate Reasoning for Solving Fuzzy Linear Programming Problems
|
|
- Janis Rice
- 7 years ago
- Views:
Transcription
1 Approximate Reasoning for Solving Fuzzy Linear Programming Problems Robert Fullér Department of Computer Science, Eötvös Loránd University, P.O.Box 157, H-1502 Budapest 112, Hungary Hans-Jürgen Zimmermann Department of Operations Research, RWTH Aachen Templergraben 64, W-5100 Aachen, Germany Abstract We interpret fuzzy linear programming (FLP) problems (where some or all coefficients can be fuzzy sets and the inequality relations between fuzzy sets can be given by a certain fuzzy relation) as multiple fuzzy reasoning schemes (MFR), where the antecedents of the scheme correspond to the constraints of the FLP problem and the fact of the scheme is the objective of the FLP problem. Then the solution process consists of two steps: first, for every decision variable x R n, we compute the maximizing fuzzy set, MAX(x), via sup-min convolution of the antecedents/constraints and the fact/objective, then an (optimal) solution to FLP problem is any point which produces a maximal element of the set {MAX(x) x R n } (in the sense of the given inequality relation). We show that our solution process for a classical (crisp) LP problem results in a solution in the classical sense, and (under well-chosen inequality relations and objective function) coincides with those suggested by [Buc88, Del87, Ram85, Ver82, Zim76]. Furthermore, we show how to extend the proposed solution principle to non-linear programming problems with fuzzy coefficients. Keywords: Compositional rule of inference, multiple fuzzy reasoning, fuzzy mathematical programming, possibilistic mathematical programming. Published in: Proceedings of 2nd International Workshop on Current Issues in Fuzzy Technologies, Trento, May 28-30, 1992, University of Trento, Partially supported by the German Academic Exchange Service (DAAD) and Hungarian Research Foundation OTKA under contracts T 4281, I/ and T
2 1 Statement of LP problems with fuzzy coefficients We consider LP problems, in which all of the coefficients are fuzzy quantities (i.e. fuzzy sets of the real line R), of the form maximize c 1 x c n x n subject to ã i1 x 1 + +ã in x < (1) n bi,i=1,...,m, where x R n is the vector of decision variables, ã ij, b i and c j are fuzzy quantities, the operations addition and multiplication by a real number of fuzzy quantities are defined by Zadeh s extension principle [Zad75], the inequality relation < is given by a certain fuzzy relation and the objective function is to be maximized in the sense of a given crisp inequality relation between fuzzy quantities. The FLP problem (1) can be stated as follows: Find x R n such that c 1 x c n x n c 1 x c n x n (2) ã i1 x 1 + +ã in x < n bi,i=1,...,m, i.e. we search for an alternative, x, which maximizes the objective function subject to constraints. We recall now some definitions needed in the following. A fuzzy number ã is a fuzzy quantity with a normalized (i.e. there exists a unique a R, such that µã(a) =1), continuous, fuzzy convex membership function of bounded support. The real number a which maximizes the membership function of the fuzzy number ã called the peak of ã, and we write peak(ã) =a. A symmetric triangular fuzzy number ã denoted by (a, α) is defined as µã(t) = 1 a t /α if a t α and µã(t) =0otherwise, where a R is the peak and 2α >0 is the spread of ã. We shall use the following crisp inequality relations between two fuzzy quantities ã and b ã b iff max{ã, b} = b (3) ã b iff ã b (4) where max is defined by Zadeh s extension principle. The compositional rule of inference scheme with several relations (called Multiple Fuzzy Reasoning Scheme) [Zad73] has the general form Fact X has property P Relation 1: X and Y are in relation W Relation m: X and Y are in relation W m Consequence: Y has property Q 2
3 where X and Y are linguistic variables taking their values from fuzzy sets in classical sets U and V, respectively, P and Q are unary fuzzy predicates in U and V, respectively, W i is a binary fuzzy relation in U V, i=1,...,m. The consequence Q is determined by [Zad73] or in detail, m Q = P W i i=1 µ Q (y) = sup min{µ P (x),µ W1 (x, y),...,µ W1 (x, y)}. x U 2 Multiply fuzzy reasoning for solving FLP problems We consider FLP problems as MFR schemes, where the antecedents of the scheme correspond to the constraints of the FLP problem and the fact of the scheme is interpreted as the objective function of the FLP problem. Then the solution process consists of two steps: first, for every decision variable x R n, we compute the maximizing fuzzy set, MAX(x), via sup-min convolution of the antecedents/constraints and the fact/objective, then an (optimal) solution to the FLP problem is any point which produces a maximal element of the set {MAX(x) x R n } (in the sense of the given inequality relation). We interpret the FLP problem maximize subject to c 1 x c n x n ã i1 x 1 + +ã in x < n bi,i=1,...,m, (5) as Multiple Fuzzy Reasoning schemes of the form Antecedent 1 Constraint 1 (x) :=ã 11 x 1 + +ã 1n x < n b Antecedent m Constraint m (x) :=ã m1 x 1 + +ã mn x < n bm Fact Goal(x) := c 1 x c n x n Consequence MAX(x) where x R n and the consequence (i.e. the maximizing fuzzy set) MAX(x) is computed as follows m MAX(x) =Goal(x) Constraint i (x), i=1 3
4 i.e. µ MAX(x) (v) = sup min{µ Goal(x) (u),µ Constraint1 (x)(u, v),...,µ Constraintm (u, v)}. u We regard MAX(x) as the (fuzzy) value of the objective function at the point x R n. Then an optimal value of the objective function of problem (5), denoted by M,isdefined as M := sup{max(x) x R n }, (6) where sup is understood in the sense of the given inequality relation. Finally, a solution x R n to problem (5) is obtained by solving the equation MAX(x) =M. The set of solutions of problem (5) is non-empty iff the set of maximizing elements of {MAX(x) x R n } (7) is non-empty. Remark 2.1 To determine the maximum of the set (7) with respect to the inequality relation is usually a very complicated process. However, this problem can lead to a crisp LP problem [Zim78, Buc89], crisp multiple criteria parametric linear programming problem (see e.g. [Del87, Del88, Ver82, Ver84]) or nonlinear mathematical programming problem (see e.g. [Zim86]). If the inequality relation for the objective function is not crisp, then we somehow have to find an element from the set (7) which can be considered as a best choice in the sense of the given fuzzy inequality relation [Ovc89, Orl80, Ram85, Rom89, Rou85, Tan84]. 3 Extension to FMP problems with fuzzy coefficients In this section we show how the proposed approach can be extended to non-linear FMP problems with fuzzy coefficients. Generalizing the classical MP problem maximize g(c, x) subject to f i (a i,x) b i,i=1,...,m, where x R n, c = (c i,...,c k ) and a i = (a i1,...,a il ) are vectors of crisp coefficients, we consider the following FMP problem maximize subject to g( c 1,... c k,x) f i (ã i1,...ã il,x) < b i,i=1,...,m, 4
5 where x R n, c h, h =1,...,k, ã is, s =1,...,l, and b i are fuzzy quantities, the functions g( c, x) and f i (ã i,x) are defined by Zadeh s extension principle, and the inequality relation < is defined by a certain fuzzy relation. We interpret the above FMP problem as MFR schemes of the form Antecedent 1: Constraint 1 (x) :=f i (ã 11,...ã 1l,x) < b Antecedent m: Constraint m (x) :=f m (ã m1,...ã ml,x) < b m Fact: Goal(x) :=g( c 1,..., c k,x) Consequence MAX(x) Then the solution process is carried out analogously to the linear case, i.e an optimal value of the objective function, M, isdefined by (6), and a solution x R n is obtained by solving the equation MAX(x) =M. 4 Relation to classical LP problems In this section we show that our solution process for classical LP problems results in a solution in the classical sense. A classical LP problem can be stated as follows max <c,x> (8) Ax b Let X be the set of optimal solutions to (8), and if X is not empty, then let v =<c,x > denote the optimal value of its objective function. In the following ā denotes the characteristic function of the singleton a R, i.e. µā(t) =1if t = a and µā(t) =0otherwise. Consider now the crisp problem (8) with fuzzy singletons and crisp inequality relations max < c, x > (9) Āx b where Ā =[ā i,j], b =( b i ), c =( c j ), and ā i1 x 1 + +ā in x n b i iff a i1 x a in x n b i, i.e. 1 if u = v and <a i,x> b i µāi1 x 1 + +ā in x n b i (u, v) = 0 if u = v and <a i,x>> b i 0 if u v (10) 5
6 The following theorem can be proved directly by using the definition of the inequality relation (10). Theorem 4.1 The sets of solutions of LP problem (8) and FLP problem (9) are equal, and the optimal value of the FLP problem is the characteristic function of the optimal value of the LP problem. 5 Crisp objective and fuzzy constraints FLP problems with crisp inequality relations in fuzzy constraints and crisp objective function can be formulated as follows (see e.g. Negoita s robust programming [Neg81], Ramik and Rimanek s approach [Ram85]) max s.t. <c,x> ã i1 x 1 + +ã in x n b i,i=1,...,m. (11) It is easy to see that problem (11) is equivalent to the crisp MP: where, max x X <c,x> (12) X = {x R n ã i1 x 1 + +ã in x n b i,i=1,...,m}. Now we show that our approach leads to the same crisp MP problem (12). Consider problem (11) with fuzzy singletons in the objective function max < c, x > s.t. ã i1 x 1 + +ã in x n b i,i=1,...,m. where the inequality relation is defined by 1 if u = v and < ã i,x> b i µãi1 x 1 + +ã in x n b i (u, v) = 0 if u = v and < ã i,x>> b i 0 if u v Then we have { 1 if v =< c,x>and x X µ MAX(x) (v) = 0 otherwise Thus, to find a maximizing element of the set {MAX(x) x R n } in the sense of the given inequality relation we have to solve the crisp problem (12). 6
7 6 Fuzzy objective and crisp constraints Consider the FLP problem with fuzzy coefficients in the objective function and fuzzy singletons in the constraints maximize subject to c 1 x c n x n ā i1 x 1 + +ā in x n b i,i=1,...,m, (13) where the inequality relation for constraints is defined by (10) and the objective function is to be maximized in the sense of the inequality relation (3), i.e. < c, x > < c, x > iff max{< c, x >, < c, x >} =< c, x > Then µ MAX(x) (v), v R, is the optimal value of the following crisp MP problem maximize µ c1 x c nx n (v) subject to Ax b, and the problem of computing a solution to FLP problem (13) leads to the same crisp multiple objective parametric linear programming problem obtained by Delgado et al. [Del87, Del88] and Verdegay [Ver82, Ver84]. 7 Relation to Buckley s possibilistic LP We show that when the inequality relations in an FLP problem are defined in a possibilistic sense then the optimal value of the objective function is equal to the possibility distribution of the objective function defined by Buckley [Buc88]. Consider a possibilistic LP maximize subject to Z := c 1 x c n x n ã i1 x 1 + +ã in x n b i,i=1,...,m. (14) The possibility distribution of the objective function Z, denoted by P oss[z = z], is defined by [Buc88] P oss[z = z] = sup min{p oss[z = z x], P oss[< ã 1,x> b 1 ],...,Poss[< ã m,x> b m ]}, x where P oss[z = z x], the conditional possibility that Z = z given x, isdefined by P oss[z = z x] =µ c1 x c nx n (z). The following theorem can be proved directly by using the definitions of P oss[z = z] and µ M (v). 7
8 Theorem 7.1 For the FLP problem maximize subject to c 1 x c n x n ã i1 x 1 + +ã in x < n bi,i=1,...,m. (15) where the inequality relation < is defined by { P oss[< ãi,x> µãi1 x 1 + +ã in x < (u, v) = b i ] if u = v n bi 0 otherwise and the objective function is to be maximized in the sense of the inequality relation (4), the following equality holds µ M (v) =P oss[z = v], v R n. So, if the inequality relations for constraints are defined in a possibilistic sense and the objective function is to be maximized in relation (4) then the optimal value of the objective function of problem (15) is equal to the possibility distribution of the objective function of possibilistic LP (14). In a similar manner it can be swhon that the proposed solution concept is a generalization of Zimmermann s method [Zim76] for solving LP problems with soft constraints. 8 Example We illustrate our approach by the following FLP problem maximize cx subject to ãx < b, x 0, (16) where ã = (1, 1), b = (2, 1) and c = (3, 1) are fuzzy numbers of symmetric triangular form, the inequality relation < is defined in a possibilistic sense, i.e. { P oss[ãx b] if u = v, µãx < b(u, v) = 0 otherwise and the inequality relation for the values of the objective function is defined by cx cx iff peak( cx) peak( cx ). It is easy to compute that 4 v/2 if v/x [3, 4] µ M (v) =µ MAX(2) (v) = v/x 2 if v/x [2, 3] 0 otherwise 8
9 so, the unique solution to (16) is x =2. This result can be interpreted as: the solution to problem (16) is equal to the solution to the following crisp LP problem max 3x s.t. x 2, x 0, where the coefficients are the peaks of the fuzzy coefficients of problem (16), and the optimal value of problem (16), which can be called v is approximately equal to 6, can be considered as an approximation of the optimal value of the crisp problem v = Figure 1. The membership function of the optimal value of problem (16). Concluding remarks. We have interpreted FLP problems with fuzzy coefficients as MFR schemes, where the antecedents of the scheme correspond to the constraints of the FLP problem and the fact of the scheme is the objective of the FLP problem. Using the compositional rule of inference, we have shown a method for finding an optimal value of the objective function and an optimal solution. In the general case the computerized implementation of the proposed solution principle is not easy. To compute MAX(x) we have to solve a generally non-convex and non-differentiable mathematical programming problem. However, the stability property of the consequence in MFR schemes under small changes of the membership function of the antecedents [Ful91] guarantees that small rounding errors of digital computation and small errors of measurement in membership functions of the coefficients of the FLP problem can cause only a small deviation in the membership function of the consequence, MAX(x), i.e. every successive approximation method can be applied to the computation of the linguistic approximation of the exact MAX(x). As was pointed out in Section 2, to find an optimal value of the objective function, M, from the equation (6) can be a very complicated process (for related works see e.g. [Car82, Car87, Neg81, Orl80, Ver82, Ver84, Zim85, Zim86) and very often we have to put up with a compromise solution [Rom89]. An efficient fuzzy-reasoning-based method is needed for the exact computation of M. Our solution principle can be applied to multiple criteria mathematical pro- 9
10 gramming problems with fuzzy coefficients. This topic will be the subject of future research. Acknowledgements The authors are indebted to Brigitte Werners of RWTH Aachen and the participants of the Workshop on Current Issues on Fuzzy Technologies 1992 for their valuable comments and helpful suggestions. References [Buc88] [Buc89] [Car82] [Car87] [Del87] [Del88] [Dub80] [Ful91] [Neg81] [Orl80] J.J.Buckley, Possibilistic linear programming with triangular fuzzy numbers, Fuzzy sets and Systems, 26(1988) J.J.Buckley, Solving possibilistic linear programming problems, Fuzzy Sets and Systems, 31(1989) C.Carlsson, Tackling an MCDM-problem with the help of some results from fuzzy sets theory, European Journal of Operational research, 3(1982) C.Carlsson, Approximate reasoning for solving fuzzy MCDM problems, Cybernetics and Systems: An International Journal, 18(1987) M.Delgado,J.L.Verdegay and M.A.Vila, Imprecise costs in mathematical programming problems, Control and Cybernetics, 16(1987) M.Delgado,J.L.Verdegay and M.A.Vila, A procedure for ranking fuzzy numbers using fuzzy relations, Fuzzy Sets and Systems, 26(1988) D.Dubois and H.Prade, Systems of linear fuzzy constraints, Fuzzy Sets and Systems 3(1980) R.Fullér and H.-J.Zimmermann, On Zadeh s compositional rule of inference, in: R.Lowen and M.Roubens eds., Proc. of Fourth IFSA Congress, Vol. Artifical Intelligence, Brussels, C.V.Negoita, The current interest in fuzzy optimization, Fuzzy Sets and System, 6(1981) S.A.Orlovski, On formalization of a general fuzzy mathematical problem, Fuzzy Sets and Systems, 3(1980)
11 [Ovc89] [Ram85] S.V.Ovchinnikov, Transitive fuzzy orderings of fuzzy numbers, Fuzzy Sets and Systems, 30(1989) J.Ramik and J.Rimanek, Inequality relation between fuzzy numbers and its use in fuzzy optimization, Fuzzy Sets and Systems, 16(1985) [Rom89] H.Rommelfanger, Entscheiden bei Unschärfe, Springer-Verlag, Berlin, [Tan84] [Ver82] [Ver84] [Zad73] [Zad75] [Zim78] [Zim85] [Zim86] [Zim76] H.Tanaka and K.Asai, Fuzzy solution in fuzzy linear programming problems, IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-14, J.L.Verdegay, Fuzzy mathematical programming, in: M.M.Gupta and E.Sanchez eds., Fuzzy Information and Decision Processes, North- Holland, J.L.Verdegay, Applications of fuzzy optimization in operational research, Control and Cybernetics, 13(1984) L.A.Zadeh, Outline of a new approach to the analysis of complex systems and decision processes, IEEE Trans. on Systems, Man and Cybernetics, Vol.SMC-3, No.1, L.A.Zadeh, The concept of linguistic variable and its applications to approximate reasoning, Parts I,II,III, Information Sciences, 8(1975) ; 8(1975) ; 9(1975) H.-J.Zimmermann, Fuzzy programming and linear programming with several objective functions, Fuzzy Sets and Systems,1(1978) H.-J.Zimmermann, Applications of fuzzy set theory to mathematical programming, Information Sciences 36(1985) H.-J.Zimmermann, Fuzzy Sets Theory and Mathematical Programming, in: A.Jones et al. (eds.), Fuzzy Sets Theory and Applications, D.Reidel Publishing Company, H.-J.Zimmermann, Description and optimization of fuzzy system, International Journal of General Systems, 2(1976)
Optimization under fuzzy if-then rules
Optimization under fuzzy if-then rules Christer Carlsson christer.carlsson@abo.fi Robert Fullér rfuller@abo.fi Abstract The aim of this paper is to introduce a novel statement of fuzzy mathematical programming
More informationA Method for Solving Linear Programming Problems with Fuzzy Parameters Based on Multiobjective Linear Programming Technique
A Method for Solving Linear Programming Problems with Fuzzy Parameters Based on Multiobjective Linear Programming Technique M. ZANGIABADI, H.. MALEKI, M. MASHINCHI Faculty of Mathematics and Computer Sciences
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More informationProximal mapping via network optimization
L. Vandenberghe EE236C (Spring 23-4) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:
More informationOptimization of Fuzzy Inventory Models under Fuzzy Demand and Fuzzy Lead Time
Tamsui Oxford Journal of Management Sciences, Vol. 0, No. (-6) Optimization of Fuzzy Inventory Models under Fuzzy Demand and Fuzzy Lead Time Chih-Hsun Hsieh (Received September 9, 00; Revised October,
More informationDouble Fuzzy Point Extension of the Two-step Fuzzy Rule Interpolation Methods
Acta Polytechnica Hungarica Vol. 10, No. 5, 2013 Double Fuzzy Point Extension of the Two-step Fuzzy Rule Interpolation Methods Zoltán Krizsán, Szilveszter Kovács University of Miskolc Egyetemváros 3515
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationFuzzy Probability Distributions in Bayesian Analysis
Fuzzy Probability Distributions in Bayesian Analysis Reinhard Viertl and Owat Sunanta Department of Statistics and Probability Theory Vienna University of Technology, Vienna, Austria Corresponding author:
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationNeuro-Fuzzy Methods. Robert Fullér Eötvös Loránd University, Budapest. VACATION SCHOOL Neuro-Fuzzy Methods for Modelling & Fault Diagnosis
Neuro-Fuzzy Methods Robert Fullér Eötvös Loránd University, Budapest VACATION SCHOOL Neuro-Fuzzy Methods for Modelling & Fault Diagnosis Lisbon, August 31 and September 1, 2001 1 Fuzzy logic and neural
More informationA New Method for Multi-Objective Linear Programming Models with Fuzzy Random Variables
383838383813 Journal of Uncertain Systems Vol.6, No.1, pp.38-50, 2012 Online at: www.jus.org.uk A New Method for Multi-Objective Linear Programming Models with Fuzzy Random Variables Javad Nematian * Department
More informationPortfolio selection based on upper and lower exponential possibility distributions
European Journal of Operational Research 114 (1999) 115±126 Theory and Methodology Portfolio selection based on upper and lower exponential possibility distributions Hideo Tanaka *, Peijun Guo Department
More informationStochastic Inventory Control
Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationWe shall turn our attention to solving linear systems of equations. Ax = b
59 Linear Algebra We shall turn our attention to solving linear systems of equations Ax = b where A R m n, x R n, and b R m. We already saw examples of methods that required the solution of a linear system
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationFuzzy Numbers in the Credit Rating of Enterprise Financial Condition
C Review of Quantitative Finance and Accounting, 17: 351 360, 2001 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Fuzzy Numbers in the Credit Rating of Enterprise Financial Condition
More informationProduct Selection in Internet Business, A Fuzzy Approach
Product Selection in Internet Business, A Fuzzy Approach Submitted By: Hasan Furqan (241639) Submitted To: Prof. Dr. Eduard Heindl Course: E-Business In Business Consultancy Masters (BCM) Of Hochschule
More informationFuzzy regression model with fuzzy input and output data for manpower forecasting
Fuzzy Sets and Systems 9 (200) 205 23 www.elsevier.com/locate/fss Fuzzy regression model with fuzzy input and output data for manpower forecasting Hong Tau Lee, Sheu Hua Chen Department of Industrial Engineering
More information1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
More informationOptimal shift scheduling with a global service level constraint
Optimal shift scheduling with a global service level constraint Ger Koole & Erik van der Sluis Vrije Universiteit Division of Mathematics and Computer Science De Boelelaan 1081a, 1081 HV Amsterdam The
More informationDuality in General Programs. Ryan Tibshirani Convex Optimization 10-725/36-725
Duality in General Programs Ryan Tibshirani Convex Optimization 10-725/36-725 1 Last time: duality in linear programs Given c R n, A R m n, b R m, G R r n, h R r : min x R n c T x max u R m, v R r b T
More informationSome Research Problems in Uncertainty Theory
Journal of Uncertain Systems Vol.3, No.1, pp.3-10, 2009 Online at: www.jus.org.uk Some Research Problems in Uncertainty Theory aoding Liu Uncertainty Theory Laboratory, Department of Mathematical Sciences
More informationLECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005
LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005 DAVID L. BERNICK dbernick@soe.ucsc.edu 1. Overview Typical Linear Programming problems Standard form and converting
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
More informationChapter 3: Section 3-3 Solutions of Linear Programming Problems
Chapter 3: Section 3-3 Solutions of Linear Programming Problems D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 3: Section 3-3 Solutions of Linear Programming
More informationAnalysis of an Artificial Hormone System (Extended abstract)
c 2013. This is the author s version of the work. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purpose or for creating
More informationLinear Equations in One Variable
Linear Equations in One Variable MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this section we will learn how to: Recognize and combine like terms. Solve
More informationFUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM
International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
More informationA Robust Formulation of the Uncertain Set Covering Problem
A Robust Formulation of the Uncertain Set Covering Problem Dirk Degel Pascal Lutter Chair of Management, especially Operations Research Ruhr-University Bochum Universitaetsstrasse 150, 44801 Bochum, Germany
More informationA Numerical Study on the Wiretap Network with a Simple Network Topology
A Numerical Study on the Wiretap Network with a Simple Network Topology Fan Cheng and Vincent Tan Department of Electrical and Computer Engineering National University of Singapore Mathematical Tools of
More informationA FUZZY LOGIC APPROACH FOR SALES FORECASTING
A FUZZY LOGIC APPROACH FOR SALES FORECASTING ABSTRACT Sales forecasting proved to be very important in marketing where managers need to learn from historical data. Many methods have become available for
More informationLecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
More informationLeast-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationRobust Geometric Programming is co-np hard
Robust Geometric Programming is co-np hard André Chassein and Marc Goerigk Fachbereich Mathematik, Technische Universität Kaiserslautern, Germany Abstract Geometric Programming is a useful tool with a
More informationAPPLICATION SCHEMES OF POSSIBILITY THEORY-BASED DEFAULTS
APPLICATION SCHEMES OF POSSIBILITY THEORY-BASED DEFAULTS Churn-Jung Liau Institute of Information Science, Academia Sinica, Taipei 115, Taiwan e-mail : liaucj@iis.sinica.edu.tw Abstract In this paper,
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationSupport Vector Machines Explained
March 1, 2009 Support Vector Machines Explained Tristan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introduction This document has been written in an attempt to make the Support Vector Machines (SVM),
More informationA New Interpretation of Information Rate
A New Interpretation of Information Rate reproduced with permission of AT&T By J. L. Kelly, jr. (Manuscript received March 2, 956) If the input symbols to a communication channel represent the outcomes
More informationLinear Programming I
Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins
More informationEquations, Inequalities & Partial Fractions
Contents Equations, Inequalities & Partial Fractions.1 Solving Linear Equations 2.2 Solving Quadratic Equations 1. Solving Polynomial Equations 1.4 Solving Simultaneous Linear Equations 42.5 Solving Inequalities
More informationZeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationNumerisches Rechnen. (für Informatiker) M. Grepl J. Berger & J.T. Frings. Institut für Geometrie und Praktische Mathematik RWTH Aachen
(für Informatiker) M. Grepl J. Berger & J.T. Frings Institut für Geometrie und Praktische Mathematik RWTH Aachen Wintersemester 2010/11 Problem Statement Unconstrained Optimality Conditions Constrained
More informationFuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
More informationOn Quantum Hamming Bound
On Quantum Hamming Bound Salah A. Aly Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA Email: salah@cs.tamu.edu We prove quantum Hamming bound for stabilizer codes
More informationSeveral Views of Support Vector Machines
Several Views of Support Vector Machines Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007 Tikhonov Regularization We are considering algorithms of the form min
More informationLecture 11: 0-1 Quadratic Program and Lower Bounds
Lecture : - Quadratic Program and Lower Bounds (3 units) Outline Problem formulations Reformulation: Linearization & continuous relaxation Branch & Bound Method framework Simple bounds, LP bound and semidefinite
More information1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style
Factorisation 1.5 Introduction In Block 4 we showed the way in which brackets were removed from algebraic expressions. Factorisation, which can be considered as the reverse of this process, is dealt with
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationDate: April 12, 2001. Contents
2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationFactoring Cubic Polynomials
Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationImprecise probabilities, bets and functional analytic methods in Łukasiewicz logic.
Imprecise probabilities, bets and functional analytic methods in Łukasiewicz logic. Martina Fedel joint work with K.Keimel,F.Montagna,W.Roth Martina Fedel (UNISI) 1 / 32 Goal The goal of this talk is to
More informationA Multi-attribute Decision Making Approach for Resource Allocation in Software Projects
A Multi-attribute Decision Making Approach for Resource Allocation in Software Projects A. Ejnioui, C. E. Otero, and L. D. Otero 2 Information Technology, University of South Florida Lakeland, Lakeland,
More informationMathematical finance and linear programming (optimization)
Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More informationApplied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
More informationSensitivity analysis of utility based prices and risk-tolerance wealth processes
Sensitivity analysis of utility based prices and risk-tolerance wealth processes Dmitry Kramkov, Carnegie Mellon University Based on a paper with Mihai Sirbu from Columbia University Math Finance Seminar,
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
More informationInternational Doctoral School Algorithmic Decision Theory: MCDA and MOO
International Doctoral School Algorithmic Decision Theory: MCDA and MOO Lecture 2: Multiobjective Linear Programming Department of Engineering Science, The University of Auckland, New Zealand Laboratoire
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationSECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationResearch Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
More informationLecture 1: Systems of Linear Equations
MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationOptimization in R n Introduction
Optimization in R n Introduction Rudi Pendavingh Eindhoven Technical University Optimization in R n, lecture Rudi Pendavingh (TUE) Optimization in R n Introduction ORN / 4 Some optimization problems designing
More informationHigh-Mix Low-Volume Flow Shop Manufacturing System Scheduling
Proceedings of the 14th IAC Symposium on Information Control Problems in Manufacturing, May 23-25, 2012 High-Mix Low-Volume low Shop Manufacturing System Scheduling Juraj Svancara, Zdenka Kralova Institute
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationApplication. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.
Polynomial and Rational Functions Outline 3-1 Polynomial Functions 3-2 Finding Rational Zeros of Polynomials 3-3 Approximating Real Zeros of Polynomials 3-4 Rational Functions Chapter 3 Group Activity:
More informationLinear programming with fuzzy parameters: An interactive method resolution q
European Journal of Operational Research xxx (005) xxx xxx www.elsevier.com/locate/ejor Linear programming with fuzzy parameters: An interactive method resolution q Mariano Jiménez a, *, Mar Arenas b,
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationThe Method of Partial Fractions Math 121 Calculus II Spring 2015
Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method
More informationA Log-Robust Optimization Approach to Portfolio Management
A Log-Robust Optimization Approach to Portfolio Management Dr. Aurélie Thiele Lehigh University Joint work with Ban Kawas Research partially supported by the National Science Foundation Grant CMMI-0757983
More information5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
More informationLinear Equations and Inequalities
Linear Equations and Inequalities Section 1.1 Prof. Wodarz Math 109 - Fall 2008 Contents 1 Linear Equations 2 1.1 Standard Form of a Linear Equation................ 2 1.2 Solving Linear Equations......................
More informationNonlinear Optimization: Algorithms 3: Interior-point methods
Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2006 Jean-Philippe Vert,
More informationLargest Fixed-Aspect, Axis-Aligned Rectangle
Largest Fixed-Aspect, Axis-Aligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: February 21, 2004 Last Modified: February
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More informationIntegrating Benders decomposition within Constraint Programming
Integrating Benders decomposition within Constraint Programming Hadrien Cambazard, Narendra Jussien email: {hcambaza,jussien}@emn.fr École des Mines de Nantes, LINA CNRS FRE 2729 4 rue Alfred Kastler BP
More informationON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four
More information4. Continuous Random Variables, the Pareto and Normal Distributions
4. Continuous Random Variables, the Pareto and Normal Distributions A continuous random variable X can take any value in a given range (e.g. height, weight, age). The distribution of a continuous random
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationChapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints
Chapter 6 Linear Programming: The Simplex Method Introduction to the Big M Method In this section, we will present a generalized version of the simplex method that t will solve both maximization i and
More informationIntroduction to Support Vector Machines. Colin Campbell, Bristol University
Introduction to Support Vector Machines Colin Campbell, Bristol University 1 Outline of talk. Part 1. An Introduction to SVMs 1.1. SVMs for binary classification. 1.2. Soft margins and multi-class classification.
More information3.6. Partial Fractions. Introduction. Prerequisites. Learning Outcomes
Partial Fractions 3.6 Introduction It is often helpful to break down a complicated algebraic fraction into a sum of simpler fractions. For 4x + 7 example it can be shown that x 2 + 3x + 2 has the same
More informationAlgebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.
More informationOn the representability of the bi-uniform matroid
On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large
More informationIntroduction to Linear Programming (LP) Mathematical Programming (MP) Concept
Introduction to Linear Programming (LP) Mathematical Programming Concept LP Concept Standard Form Assumptions Consequences of Assumptions Solution Approach Solution Methods Typical Formulations Massachusetts
More informationRecovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach
MASTER S THESIS Recovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach PAULINE ALDENVIK MIRJAM SCHIERSCHER Department of Mathematical
More information1 Portfolio mean and variance
Copyright c 2005 by Karl Sigman Portfolio mean and variance Here we study the performance of a one-period investment X 0 > 0 (dollars) shared among several different assets. Our criterion for measuring
More informationLecture 5 Principal Minors and the Hessian
Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More information