BT8118 – Adv. Topics in Systems Biology

Slides:



Advertisements
Similar presentations
Solving Linear Programming Problems
Advertisements

Tuesday, March 5 Duality – The art of obtaining bounds – weak and strong duality Handouts: Lecture Notes.
1 Outline relationship among topics secrets LP with upper bounds by Simplex method basic feasible solution (BFS) by Simplex method for bounded variables.
Lets begin constructing the model… Step (I) - Definitions We begin with a very simple imaginary metabolic network represented as a directed graph: Vertex.
IEOR 4004 Midterm Review (part I)
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
IEOR 4004 Midterm review (Part II) March 12, 2014.
Understanding optimum solution
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Lecture 8 Tuesday, 11/19/02 Linear Programming.
Crew Scheduling Housos Efthymios, Professor Computer Systems Laboratory (CSL) Electrical & Computer Engineering University of Patras.
Part 3 Linear Programming 3.4 Transportation Problem.
Flux Balance Analysis. FBA articles Advances in flux balance analysis. K. Kauffman, P. Prakash, and J. Edwards. Current Opinion in Biotechnology 2003,
CSCI 3160 Design and Analysis of Algorithms Tutorial 6 Fei Chen.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2006 Lecture 9 Wednesday, 11/15/06 Linear Programming.
Flux balance analysis in metabolic networks Lecture notes by Eran Eden.
1 Introduction to Linear and Integer Programming Lecture 9: Feb 14.
Dual Problem of Linear Program subject to Primal LP Dual LP subject to ※ All duality theorems hold and work perfectly!
Duality Dual problem Duality Theorem Complementary Slackness
Approximation Algorithms
Humboldt- Universität Zu Berlin Edda Klipp, Humboldt-Universität zu Berlin Edda Klipp Systembiologie 4 – Flux Balance Analysis Sommersemester 2010 Humboldt-Universität.
Linear Programming – Max Flow – Min Cut Orgad Keller.
Review of Reservoir Problem OR753 October 29, 2014 Remote Sensing and GISc, IST.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2008 Lecture 9 Tuesday, 11/18/08 Linear Programming.
1 Linear Programming Supplements (Optional). 2 Standard Form LP (a.k.a. First Primal Form) Strictly ≤ All x j 's are non-negative.
Graduate Program in Business Information Systems Linear Programming: Sensitivity Analysis and Duality Aslı Sencer.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
L20 LP part 6 Homework Review Postoptimality Analysis Summary 1.
Lecture #23 Varying Parameters. Outline Varying a single parameter – Robustness analysis – Old core E. coli model – New core E. coli model – Literature.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Transformation of Timed Automata into Mixed Integer Linear Programs Sebastian Panek.
The Optimal Metabolic Network Identification Paula Jouhten Seminar on Computational Systems Biology
Linear Programming: Data Fitting Steve Gu Mar 21, 2008.
Introduction to Operations Research
Solution Space? In most cases lack of constraints provide a space of solutions What can we do with this space? 1.Optimization methods (previous lesson)
Department Of Industrial Engineering Duality And Sensitivity Analysis presented by: Taha Ben Omar Supervisor: Prof. Dr. Sahand Daneshvar.
BIOINFORMATICS ON NETWORKS Nick Sahinidis University of Illinois at Urbana-Champaign Chemical and Biomolecular Engineering.
TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A A A A A A A Image:
1 Departament of Bioengineering, University of California 2 Harvard Medical School Department of Genetics Metabolic Flux Balance Analysis and the in Silico.
Linear Programming Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
EASTERN MEDITERRANEAN UNIVERSITY Department of Industrial Engineering Non linear Optimization Spring Instructor: Prof.Dr.Sahand Daneshvar Submited.
Take out you homework ( Page 12 from WB ) this will be one of the few times you need to separate a page out of your WB Write an equation to represent.
1 Chapter 1: Introduction to Mathematical Optimization 1.1 Introduction 1.2 Simple Examples 1.3 The OPTMODEL Procedure.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 13 Duality Theory.
1 System Planning 2013 Lecture 7: Optimization Appendix A Contents: –General about optimization –Formulating optimization problems –Linear Programming.
In silico gene targeting approach integrating signaling, metabolic, and regulatory networks Bin Song Jan 29, 2009.
CPS 173 Linear programming, integer linear programming, mixed integer linear programming
CPSC 536N Sparse Approximations Winter 2013 Lecture 1 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAA.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
Part 3 Linear Programming 3.3 Theoretical Analysis.
BT8118 – Adv. Topics in Systems Biology
Lap Chi Lau we will only use slides 4 to 19
Linear Programming: Sensitivity Analysis and Duality
Topics in Algorithms Lap Chi Lau.
The minimum cost flow problem
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
integer linear programming, mixed integer linear programming
Chap 9. General LP problems: Duality and Infeasibility
The Simplex Method: Standard Minimization Problems
Part 3 Linear Programming
I. Floorplanning with Fixed Modules
ECEN 460 Power System Operation and Control
Sensitivity.
A Primal-Dual Solution to Minimal Test Generation Problem
INFM 718A / LBSC 705 Information For Decision Making
BT8118 – Adv. Topics in Systems Biology
Lecture 20 Linear Program Duality
BT8118 – Adv. Topics in Systems Biology
Overview of the Pathway Tools FBA Module
Presentation transcript:

BT8118 – Adv. Topics in Systems Biology Prof. Eivind Almaas Dept. of Biotechnology, NTNU

Overview of today Go through 2 homework problems Duality of linear program  Bilevel optimization revisited Phenotype Phase Plane (PhPP) Analysis Guest lecture: Per Bruheim on Metabolite and flux measurements Discussion of individual projects

Simple LP example

Simple IP example MatLab Task: 1. Change rhs value from 15 to 17. Find new maximal (x1, x2) Use glpk function in MatLab to solve this as a MILP with 2. x1 and x2 as binary variables 3. x1 as binary variable 4. x1 as integer variable

FBA & MoMA: detailed comparison Example reaction set: Corresponding network & WT solution from FBA: Task: 1. Write down S matrix and constraints 2. Use MatLab “linprog” function to maximize R8 3. What happens with objective if R5 upper bound is reduced? 3. Knockout the “gene” R4 4. Find new fluxes using “linprog” 5. Find new fluxes using “quadprog” and the MoMA formulation Maximize reaction R8

FBA & MoMA: detailed comparison Example reaction set: Corresponding network & WT solution from FBA: Using perturbed network: (1) FBA optimal solution (2) MoMA solution Maximize reaction R8 D. Segre et. al. OMICS 7, 301 (2003).

Duality of Linear Programming Given linear program: The dual program is: How do we go from primal problem to dual problem?

Relationship between P and D BUT: Will min(D) = max(P) ??

Duality theorem of LP

Dualization Recipe

What is the D of this P?

Bilevel optimization revisited Engineering Biology

Can you put together the pieces and state the OptKnock formulation Challenge: Can you put together the pieces and state the OptKnock LP problem?

Dual of the “Biological Problem”

Assessment of sensitivity of objective function Phenotype Phase-Plane (PhPP) Analysis Central tool for PhPP: Assessment of sensitivity of objective function What is response of objective function Z to Changes in internal fluxes?  reduced costs Changes in the bounds vector?  shadow price

Definitions Shadow price: Reduced cost: PhPP defined using Shadow Prices

Example: Adaptive evolution of E. coli Fong et al, J. Bact. 185, 6400 (2003)

Example: Adaptive evolution of E. coli

Geometrical interpretation of Shadow Price Note: The shadow price = optimal value of dual variable! Aucamp & Steinberg, J. Opl Res. Soc. 33, 557 (1982)

Optimal dual and shadow price x*=(0.8,0) π2=1.2

Optimal dual and shadow price  Significant caveat for degenerate situations: Aucamp & Steinberg, J. Opl Res. Soc. 33, 557 (1982)

Return to PhPP Analysis Cellular phenotype in response to variation in uptake fluxes PhPP has 2 separate regions: growth and non-growth Growth region is further split into phases according to shadow price of the independent variables (variables along axes) Within each phase, shadow prices are constant. Each phase is consistent with different cellular phenotype

Challenge: Calculate the PhPP Note: glpk will provide 1. optimal value of dual variable (extra.lambda) 2. reduced cost (extra.redcosts)

Project discussion