Fuzzy Linear Programming Wang YU Iowa State University 12/07/2001.

Slides:

Advertisements

Similar presentations

Linear Programming Problem

Advertisements

Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,

Linear Programming – Simplex Method

Assignment (6) Simplex Method for solving LP problems with two variables.

Dragan Jovicic Harvinder Singh

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.

Lecture 10: Integer Programming & Branch-and-Bound

Mata kuliah:K0164/ Pemrograman Matematika Tahun:2008 Fuzzy Linear Programming Pertemuan 10:

Basic Feasible Solutions: Recap MS&E 211. WILL FOLLOW A CELEBRATED INTELLECTUAL TEACHING TRADITION.

AN INTERACTIVE POSSIBILISTIC LINEAR PROGRAMMING APPROACH FOR MULTIPLE OBJECTIVE TRANSPORTATION PROBLEMS Dr. Celal Hakan Kagnicioglu, Assistant Anadolu.

Linear Programming Introduction George B Dantzig developed LP in It is a problem solving approach designed to help managers/decision makers in planning.

1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science 3d edition by Cliff Ragsdale.

Using Excel Solver for Linear Optimization Problems

Linear Programming Special Cases Alternate Optimal Solutions No Feasible Solution Unbounded Solutions.

Math443/543 Mathematical Modeling and Optimization

Support Vector Machines Formulation  Solve the quadratic program for some : min s. t.,, denotes where or membership.  Different error functions and measures.

EMGT 501 HW # (b) (c) 6.1-4, Due Day: Sep. 21.

1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.

Protein Encoding Optimization Student: Logan Everett Mentor: Endre Boros Funded by DIMACS REU 2004.

Problem Set # 4 Maximize f(x) = 3x1 + 2 x2 subject to x1 ≤ 4 x1 + 3 x2 ≤ 15 2x1 + x2 ≤ 10 Problem 1 Solve these problems using the simplex tableau. Maximize.

Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.

Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.

Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.

9/1 More Linear Programming Collect homework Roll call Review homework Lecture - More LP Small Groups Lecture - Start using MS Excel Assign Homework.

1 Lecture 4 Maximal Flow Problems Set Covering Problems.

Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.

13.7 – Graphing Linear Inequalities Are the ordered pairs a solution to the problem?

P I can solve linear programing problem. Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.

BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.

Introduction to Linear Programming BSAD 141 Dave Novak.

Duality Theory  Every LP problem (called the ‘Primal’) has associated with another problem called the ‘Dual’.  The ‘Dual’ problem is an LP defined directly.

Equations of Linear Relationships

Linear Programming – Simplex Method

Linear Programming with Excel Solver.  Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision.

Professor: Chu, Ta Chung Student: Nguyen Quang Tung Student’s ID: M977Z235 Fuzzy multiobjective linear model for supplier selection in a supply chain.

1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.

Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.

Chapter 4 Linear Programming: The Simplex Method

Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1 n X n

Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.

Traveling Salesman Problem IEOR 4405 Production Scheduling Professor Stein Sally Kim James Tsai April 30, 2009.

CPS Brief introduction to linear and mixed integer programming

Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.

Fuzzy Optimization D Nagesh Kumar, IISc Water Resources Planning and Management: M9L1 Advanced Topics.

Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.

IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.

Simplex Method Review. Canonical Form A is m x n Theorem 7.5: If an LP has an optimal solution, then at least one such solution exists at a basic feasible.

© 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.

CPS Brief introduction to linear and mixed integer programming

Problem 1 Demand Total There are 20 full time employees, each can produce 10.

Introduction to Linear Programs

ADVANCED COMPUTATIONAL MODELS AND ALGORITHMS

6.5 Stochastic Prog. and Benders’ decomposition

The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.

Fuzzy Linear Programming Pertemuan 8 (GSLC)

Constrained Optimization

Chapter 4 Linear Programming: The Simplex Method

Chap 9. General LP problems: Duality and Infeasibility

Introduction to linear programming (LP): Minimization

The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.

Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)

INFM 718A / LBSC 705 Information For Decision Making

Brief introduction to linear and mixed integer programming

Linear Programming Problem

LINEAR PROGRAMMING Example 1 Maximise I = x + 0.8y

Chapter-III Duality in LPP

6.5 Stochastic Prog. and Benders’ decomposition

Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.

Practical Issues Finding an initial feasible solution Cycling

Linear Constrained Optimization

Presentation transcript:

Fuzzy Linear Programming Wang YU Iowa State University 12/07/2001

Fuzzy Sets If X is a collection of objects denoted generically by x, then a fuzzy set Ã in X is a set of ordered pairs: Ã= A fuzzy set is represented solely by stating its membership function.

Linear Programming Min z=c’x St. Ax<=b, x>=0, Linear Programming can be solved efficiently by simplex method and interior point method. In case of special structures, more efficiently methods can be applied.

Fuzzy Linear Programming There are many ways to modify a LP into a fuzzy LP. The objective function maybe fuzzy The constraints maybe fuzzy The relationship between objective function and constraints maybe fuzzy. ……..

Our model for fuzzy LP Ĉ~fuzzy constraints {c,Uc} Ĝ~fuzzy goal (objective function) {g,Ug} Ď= Ĉ and Ĝ{d,Ud} Note: Here our decision Ď is fuzzy. If you want a crisp decision, we can define: λ=max Ud to be the optimal decision

Our model for fuzzy LP Cont’d

Maximize λ St. λpi+Bix<=di+pi i= 1,2,….M+1 x>=0 It’s a regular LP with one more constraint and can be solved efficiently.

Example A Crisp LP

Example A cont’d Fuzzy Objective function ( keep constraints crisp)

Example A cont’d

Example B Crisp LP

Example B cont’d Fuzzy Objective function Fuzzy Constraints Maximize λ St. λpi+Bix<=di+pi i= 1,2,….M+1 x>=0 Apply this to both of the objective function and constraints.

Example B cont’d Now d=( ,170,1300,6) P=(500000,10,100,6)

Conclusion Here we showed two cases of fuzzy LP. Depends on the models used, fuzzy LP can be very differently. ( The choosing of models depends on the cases, no general law exits.) In general, the solution of a fuzzy LP is efficient and give us some advantages to be more practical.

Conclusion Cont’d Advantages of our models: 1. Can be calculated efficiently. 2. Symmetrical and easy to understand. 3. Allow the decision maker to give a fuzzy description of his objectives and constraints. 4. Constraints are given different weights.

Reference [1] Fuzzy set theory and its applications H.-J. Zimmermann 1991 [2] Fuzzy set and decision analysis H.-J. Zimmermann, L.A.Zadeh, B.R.Gaines 1983