1 Lecture 24 – HW #10 Discrete Optimization Models Problem 11-27 on page 619 We need to move our natural gas from two fields to our main terminal. F1 F2S2.

Slides:

Advertisements

Similar presentations

Outline LP formulation of minimal cost flow problem

Advertisements

Linear Programming (LP) (Chap.29)

1 Lecture 2 Shortest-Path Problems Assignment Problems Transportation Problems.

Management Science 461 Lecture 6 – Network Flow Problems October 21, 2008.

Modeling problems with Integer Linear Programming (ILP) Name: Chuan Huang.

Call Center Scheduling Problem Federal Reserve Bank United States Treasury May 6, 2009 Morgan Brunz Brittany McCluskey.

Water Resources Development and Management Optimization (Integer Programming) CVEN 5393 Mar 11, 2013.

NetWORKS Strategy Manugistics NetWORKS Strategy 6.2.

1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.

Applications of Stochastic Programming in the Energy Industry Chonawee Supatgiat Research Group Enron Corp. INFORMS Houston Chapter Meeting August 2, 2001.

Network Optimization Models: Maximum Flow Problems

Network Optimization Models: Maximum Flow Problems In this handout: The problem statement Solving by linear programming Augmenting path algorithm.

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

Optimization for Network Planning Includes slide materials developed by Wayne D. Grover, John Doucette, Dave Morley © Wayne D. Grover 2002, 2003 E E 681.

1 An tutorial to AMPL. 2 Introduction Mathematical programming is a technique for solving certain kinds of problems --- notably maximizing profits and.

Linear Programming OPIM 310-Lecture 2 Instructor: Jose Cruz.

AMPL Presentation 1 By Raymond Kleinberg Outline AMPL - Ugh! - What is it good for? Basics Starting a Problem Running the Problem Example.

(Not in text).  An LP with additional constraints requiring that all the variables be integers is called an all-integer linear program (IP).  The LP.

Integer programming Branch & bound algorithm ( B&B )

How to Play Sudoku & Win Integer Programming Formulation of a Popular Game Sven LeyfferSven Leyffer, Argonne, Feb. 15, 2005 (windoze powerpoint sumi painting.

Network Models II Shortest Path Cross Docking Enhance Modeling Skills Modeling with AMPL Spring 03 Vande Vate.

EMIS Lecture 3 – pages Pi Hybrids Model On Page 39 FacilitiesSales Regions OK TX MI AR LA TN 4x6=24.

Network Optimization Models

15.082J and 6.855J and ESD.78J November 30, 2010 The Multicommodity Flow Problem.

Product Mix & Master Production Scheduling

Section 2.9 Maximum Flow Problems Minimum Cost Network Flows Shortest Path Problems.

GAMS Anwendung Nutzeroberfläche eigene Programme Modellierungs- System GAMS AMPL ILOG Studio … Solver CPLEX, CONOPT, MINOS, COIN, BARON,...

1 Lecture 26 – Problem Page 617 Military Problem with Three Commanders Six Radar Stations Each Commander Should Be Assigned Two Radar Stations C1C2C3.

Spring 03 Vande Vate1 Practice Final: Linear? param T; param Demand{1..T}; var InitialLevel; var GrowthRate; var Estimate{1..T}; minimize TotalError:

Linear Programming. Many mathematical models designed to solve problems in business, biology, and economics involve finding the optimum value (maximum.

WOOD 492 MODELLING FOR DECISION SUPPORT

Substitution Method: 1. Solve the following system of equations by substitution. Step 1 is already completed. Step 2:Substitute x+3 into 2 nd equation.

CS 4407, Algorithms University College Cork, Gregory M. Provan Network Optimization Models: Maximum Flow Problems In this handout: The problem statement.

Divide and Conquer Optimization problem: z = max{cx : x  S}

& 6.855J & ESD.78J Algorithm Visualization The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem.

The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem Thanks to Jim Orlin & MIT OCW.

Approximation of Non-linear Functions in Mixed Integer Programming Alexander Martin TU Darmstadt Workshop on Integer Programming and Continuous Optimization.

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 18 Branch and Bound Algorithm.

D Nagesh Kumar, IIScOptimization Methods: M6L5 1 Dynamic Programming Applications Capacity Expansion.

CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 25.

Flow in Network. Graph, oriented graph, network A graph G =(V, E) is specified by a non empty set of nodes V and a set of edges E such that each edge.

Network Simplex Animations Network Simplex Animations.

Water Resources System Modeling

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

1 Lecture 12 Chapter 7 Duality and Sensitivity in Linear Programming 7.1 Objective values usually can be interpreted as either minimize cost or maximize.

Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.

Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.

Solving IPs – Implicit Enumeration Similar to Binary IP Branch and Bound General Idea: Fixed variables – those for which a value has been fixed. Free Variable.

Intermodal Supply Chain Optimization at a Large Retailer Part 1: Model Development Scott J. Mason, Ph.D. Fluor Endowed Chair in Supply Chain Optimization.

2.3 Solving Multi-Step Equations

Stat 261 Two phase method.

Water Resources Planning and Management Daene McKinney

The CPLEX Library: Mixed Integer Programming

Lesson 41: Units, Unit Multipliers

6.5 Stochastic Prog. and Benders’ decomposition

Richard Anderson Lecture 23 Network Flow

Why network models? Visualize a mathematical model

The Transportation Problem: An Introduction

James B. Orlin Presented by Tal Kaminker

EMIS 8373: Integer Programming

MIP Tools Branch and Cut with Callbacks Lazy Constraint Callback

Obtain a Physics textbook Turn to page 387 Read pages

Prepared by Lee Revere and John Large

Chapter 6 Network Flow Models.

Warm-up: Solve the system:

6.5 Stochastic Prog. and Benders’ decomposition

Problem: How many feet are there in 78 inches? Solution:

Welcome to Who Wants to be a Millionaire

Applied Statistical and Optimization Models

Presentation transcript:

1 Lecture 24 – HW #10 Discrete Optimization Models Problem on page 619 We need to move our natural gas from two fields to our main terminal. F1 F2S2 S1 T {600} {800}

2 Jeff – when I did this before I had the wrong model – resolve with correct model and update slides

3 The Requirement Data NodeRequirement (> 0 => supply, demand) F1 (Field #1)800,000,000 cubic feet F2 (Field #2)600,000,000 cubic feet S1 (Storage Area #1)0 S2 (Storage Area #2)0 T (Main Terminal)-1,400,000,000 cubic feet

4 The Cost Data PipeLength (miles) Fixed Cost ($) Variable Cost ($/cubic foot) Capacity (cubic feet) F1S1808,000, ,000,000,000 F2F1606,000, ,000,000,000 F2S110010,000, ,000,000,000 F2S214014,000, ,000,000,000 S1S2202,000, ,000,000,000 S1T ,000,000,000 S2T ,000,000,000

5 Objective Determine the pipes to be constructed and the flow of gas to the terminal that minimizes total cost. How much does it cost to build F1S1 and send 1 cubic foot of gas through this pipe? Answer: 8,000,000 + (.002)(1) = 8,000, Cost is composed of a fixed cost plus a variable cost.

6 AMPL Model var F1S1 >= 0, <= 1000; # units are 000,000s var F2F1 >= 0, <= 1000; var F2S1 >= 0, <= 1000; var F2S2 >= 0, <= 1000; var S1S2 >= 0, <= 1000; var S1T >= 0, <= 1000; var S2T >= 0, <= 1000; var YF1S1 binary; var YF2F1 binary; var YF2S1 binary; var YF2S2 binary; var YS1S2 binary;

7 AMPL Model Continued minimize Cost: *YF1S *YF2F *YF2S *YF2S *YS1S *(F1S1 + F2F1 + F2S1 + F2S2 + S1S2 + S1T + S2T); subject to Field1: F1S1 - F2F1 = 800; subject to Field2: F2F1 + F2S1 + F2S2 = 600; subject to Storage1: S1S2 + S1T - F1S1 - F2S1 = 0; subject to Storage2: S2T - F2S2 - S1S2 = 0; subject to Terminal: -S1T -S2T = -1400;

8 AMPL Model Continued subject to FixedF1S1: F1S1 <= 1000*YF1S1; #Why does this work? subject to FixedF2F1: F2F1 <= 600*YF2F1; subject to FixedF2S1: F2S1 <= 600*YF2S1; subject to FixedF2S2: F2S2 <= 600*YF2S2; subject to FixedS1S2: S1S2 <= 1000*YS1S2; solve; display F1S1, F2F1, F2S1, F2S2, S1S2, S1T, S2T; display YF1S1, YF2F1, YF2S1, YF2S2, YS1S2;

9 Output AMPL Version Win32 CPLEX 8.0.0: optimal integer solution; objective MIP simplex iterations 0 branch-and-bound nodes F1S1 = 800 F2F1 = 0 F2S1 = 600 F2S2 = 0 S1S2 = 400 S1T = 1000 S2T = 400 YF1S1 = 1 YF2F1 = 0 YF2S1 = 1 YF2S2 = 0 YS1S2 = 1

10 Solution F1 F2S2 S1 T 800,000, ,000,000 -1,400,000,