D Nagesh Kumar, IIScOptimization Methods: M4L4 1 Linear Programming Applications Structural & Water Resources Problems.

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

Standard Minimization Problems with the Dual
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Operation Research Chapter 3 Simplex Method.
Assignment (6) Simplex Method for solving LP problems with two variables.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
D Nagesh Kumar, IIScOptimization Methods: M4L1 1 Linear Programming Applications Software for Linear Programming.
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
Water Resources Planning and Management Daene C. McKinney Water Quality.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Chapter 6 Linear Programming: The Simplex Method
The Simplex Method: Standard Maximization Problems
The Simplex Algorithm An Algorithm for solving Linear Programming Problems.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
Advanced Topics in Optimization
Linear Programming Applications
D Nagesh Kumar, IIScOptimization Methods: M2L5 1 Optimization using Calculus Kuhn-Tucker Conditions.
D Nagesh Kumar, IIScOptimization Methods: M7L1 1 Integer Programming All Integer Linear Programming.
D Nagesh Kumar, IIScOptimization Methods: M3L1 1 Linear Programming Preliminaries.
Introduction and Basic Concepts
D Nagesh Kumar, IIScOptimization Methods: M3L4 1 Linear Programming Simplex method - II.
Linear Programming Applications
D Nagesh Kumar, IIScOptimization Methods: M5L4 1 Dynamic Programming Other Topics.
D Nagesh Kumar, IIScOptimization Methods: M3L6 1 Linear Programming Other Algorithms.
Chapter 4 The Simplex Method
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
D Nagesh Kumar, IIScOptimization Methods: M1L3 1 Introduction and Basic Concepts (iii) Classification of Optimization Problems.
Simplex Algorithm.Big M Method
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
D Nagesh Kumar, IIScOptimization Methods: M5L2 1 Dynamic Programming Recursive Equations.
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Mechanical Engineering Department 1 سورة النحل (78)
10/2 The simplex algorithm. In an augmented matrix, if a column has a 1 and all other entries 0, it is said to be ‘in solution’. The 1 is called a ‘pivot’
D Nagesh Kumar, IIScOptimization Methods: M2L4 1 Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
D Nagesh Kumar, IIScOptimization Methods: M7L2 1 Integer Programming Mixed Integer Linear Programming.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ 5.5 Dual problem: minimization.
D Nagesh Kumar, IIScOptimization Methods: M6L5 1 Dynamic Programming Applications Capacity Expansion.
(iii) Lagrange Multipliers and Kuhn-tucker Conditions D Nagesh Kumar, IISc Introduction to Optimization Water Resources Systems Planning and Management:
Fuzzy Optimization D Nagesh Kumar, IISc Water Resources Planning and Management: M9L1 Advanced Topics.
Multi-objective Optimization
Linear Programming and Applications
Water Resources System Modeling
Stochastic Optimization
LINEAR PROGRAMMING.
D Nagesh Kumar, IIScOptimization Methods: M5L1 1 Dynamic Programming Introduction.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Linear Programming Water Resources Planning and Management Daene McKinney.
(i) Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M3L1 Linear Programming and Applications.
Introduction to Linear Programming and Formulation Meeting 2 Course: D Deterministic Optimization Year: 2009.
Plastic Analysis of Structures By Prof. Dr. Wail Nourildean Al-Rifaie.
Linear Programming and Applications
D Nagesh Kumar, IIScOptimization Methods: M8L6 1 Advanced Topics in Optimization Applications in Civil Engineering.
D Nagesh Kumar, IIScOptimization Methods: M8L1 1 Advanced Topics in Optimization Piecewise Linear Approximation of a Nonlinear Function.
D Nagesh Kumar, IIScOptimization Methods: M6L1 1 Dynamic Programming Applications Design of Continuous Beam.
Introduction and Preliminaries D Nagesh Kumar, IISc Water Resources Planning and Management: M4L1 Dynamic Programming and Applications.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
(iii) Simplex method - I D Nagesh Kumar, IISc Water Resources Planning and Management: M3L3 Linear Programming and Applications.
LP Examples Wastewater & Water Quality
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
Stochastic Optimization
Dynamic Programming Applications
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
The Simplex Method: Standard Minimization Problems
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Dynamic Programming and Applications
PLASTIC ANALYSIS OF STRUCTURES
Copyright © 2019 Pearson Education, Inc.
Presentation transcript:

D Nagesh Kumar, IIScOptimization Methods: M4L4 1 Linear Programming Applications Structural & Water Resources Problems

D Nagesh Kumar, IIScOptimization Methods: M4L4 2 Introduction  LP has been applied to formulate and solve several types of problems in engineering field  LP finds many applications in the field of water resources and structural design which include  Planning of urban water distribution  Reservoir operation  Crop water allocation  Minimizing the cost and amount of materials in structural design

D Nagesh Kumar, IIScOptimization Methods: M4L4 3 Objectives  To discuss the applications of LP in the plastic design of frame structures  To discuss the applications of LP in deciding the optimal pattern of irrigation

D Nagesh Kumar, IIScOptimization Methods: M4L4 4 Example – Structural Design  A beam column arrangement of a rigid frame is shown  Moment in beam is represented by M b  Moment in column is denoted by M c.  l = 8 units and h= 6 units  Forces F 1 =2 units and F 2 =1 unit. Assuming that plastic moment capacity of beam and columns are linear functions of their weights; the objective function is to minimize weights of the materials.

D Nagesh Kumar, IIScOptimization Methods: M4L4 5 Example - Structural Design …contd. Solution:  In the limit design, it is assumed that at the points of peak moments, plastic hinges will be developed  Points of development of peak moments are numbered in the above figure from 1 through 7  Development of sufficient hinges makes the structure unstable known as a collapse mechanism  For the design to be safe the energy absorbing capacity of the frame (U) should be greater than the energy imparted by externally applied load (E) for the various collapse mechanisms of the structure

D Nagesh Kumar, IIScOptimization Methods: M4L4 6 Example - Structural Design …contd.  The objective function can be written as Minimize f = weight of beam + weight of column where w is weight per unit length over unit moment in material  Since w is constant, optimizing (1) is same as optimizing

D Nagesh Kumar, IIScOptimization Methods: M4L4 7 Example - Structural Design …contd.  Four possible collapse mechanisms are shown in the figure below with the corresponding U and E values (a)(b)

D Nagesh Kumar, IIScOptimization Methods: M4L4 8 Example - Structural Design …contd. (c) (d)

D Nagesh Kumar, IIScOptimization Methods: M4L4 9 Example - Structural Design …contd.  The optimization problem can be stated as subject to

D Nagesh Kumar, IIScOptimization Methods: M4L4 10 Example - Structural Design …contd.  Introducing slack variables X 1, X 2, X 3, X 4 all, the system of equations can be written in canonical form as 16M B + 12M C – f = 0 -M c +X 1 = - 3 -M b + X 2 = M b -M c +X 3 = M b -M c +X 4 = M B + 12M C – f = 0

D Nagesh Kumar, IIScOptimization Methods: M4L4 11 Example - Structural Design …contd.  This model can be solved using Dual Simplex algorithm  The final tableau is shown below The optimal value of decision variables are M B =7/2; M C =3 And the total weight of the material required f = 92w units

D Nagesh Kumar, IIScOptimization Methods: M4L4 12 Example - Irrigation Allocation  Consider two crops 1 and 2. One unit of crop 1 produces four units of profit and one unit of crop 2 brings five units of profit. The demand of production of crop 1 is A units and that of crop 2 is B units. Let x be the amount of water required for A units of crop 1 and y be the same for B units of crop 2.  The amount of production and the amount of water required can be expressed as a linear relation as shown below A = 0.5(x - 2) + 2 B = 0.6(y - 3) + 3

D Nagesh Kumar, IIScOptimization Methods: M4L4 13 Example - Irrigation Allocation …contd.  Consider two crops 1 and 2. One unit of crop 1 produces four units of profit and one unit of crop 2 brings five units of profit. The demand of production of crop 1 is A units and that of crop 2 is B units. Let x be the amount of water required for A units of crop 1 and y be the same for B units of crop 2.  The amount of production and the amount of water required can be expressed as a linear relation as shown below A = 0.5(x - 2) + 2 B = 0.6(y - 3) + 3

D Nagesh Kumar, IIScOptimization Methods: M4L4 14 Example - Irrigation Allocation …contd. Solution:  Objective: Maximize the profit from crop 1 and 2 Maximize f = 4A + 5B;  Expressing as a function of the amount of water, Maximize f = 4[0.5(x - 2) + 2] + 5[0.6(y - 3) + 3] f = 2x + 3y + 10

D Nagesh Kumar, IIScOptimization Methods: M4L4 15 Example - Irrigation Allocation …contd. subject to  ; Maximum availability of water  ; Minimum amount of water required for crop 1  ; Minimum amount of water required for crop 2  The above problem is same as maximizing f’ = 2x + 3y subject to same constraints.

D Nagesh Kumar, IIScOptimization Methods: M4L4 16 Example - Irrigation Allocation …contd.  Changing the problem into standard form by introducing slack variables S 1, S 2, S 3 Maximize f’ = 2x + 3y subject to x + y + S 1 =10 -x + S 2 = -2 -y + S 3 = -3 This model is solved using simplex method

D Nagesh Kumar, IIScOptimization Methods: M4L4 17 Example - Irrigation Allocation …contd.  The final tableau is as shown  The solution is x = 2; y = 8; f’ = 28 Therefore, f = = 38  Water allocated to crop A is 2 units and to crop B is 8 units and total profit yielded is 38 units.

D Nagesh Kumar, IIScOptimization Methods: M4L4 18 Example – Water Quality Management  Waste load allocation for water quality management in a river system can be defined as  Determination of optimal treatment level of waste, which is discharged to a river  By maintaining the water quality standards set by Pollution Control Agency (PCA), through out the river  Conventional waste load allocation involves minimization of treatment cost subject to the constraint that the water quality standards are not violated

D Nagesh Kumar, IIScOptimization Methods: M4L4 19 Example - Waster Quality Management …contd.  Consider a simple problem of M dischargers, who discharge waste into the river, and I checkpoints, where the water quality is measured by PCA  Let x j is the treatment level and a j is the unit treatment cost for j th discharger (j=1,2,…,M)  c i is the dissolved oxygen (DO) concentration at checkpoint i (i=1,2,…,I), which is to be controlled  Decision variables for the waste load allocation model are x j (j=1,2,…,M).

D Nagesh Kumar, IIScOptimization Methods: M4L4 20 Example - Waster Quality Management …contd.  Objective function can be expressed as  Relationship between the water quality indicator, c i (DO) at a checkpoint and the treatment level upstream to that checkpoint is linear (based on Streeter-Phelps Equation)  Let g(x) denotes the linear relationship between c i and x j.  Then,

D Nagesh Kumar, IIScOptimization Methods: M4L4 21 Example - Waster Quality Management …contd.  Let c P be the permissible DO level set by PCA, which is to be maintained through out the river  Therefore,  This model can be solved using simplex algorithm which will give the optimal fractional removal levels required to maintain the water quality of the river

D Nagesh Kumar, IIScOptimization Methods: M4L4 22 Thank You