Using Variable Domain Functions

Slides:

Advertisements

Similar presentations

Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.

Advertisements

Algorithm Design Methods Spring 2007 CSE, POSTECH.

IENG442 LINGO LAB3.

Kerimcan OzcanMNGT 379 Operations Research1 Integer Linear Programming Chapter 8.

6 - 1 § 6 The Searching Strategies e.g. satisfiability problem x1x1 x2x2 x3x3 FFF FFT FTF FTT TFF TFT TTF TTT.

Poster Title 95 point, Arial font Primary heading Xx xxx x xx xxxxx xx xxxx xxx xx xx x x xxxxx xxxx xx xxxxx xx xxxxxx xxx xx. X xx xxxx xxxxx xx xxxx.

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 16, Monday, October 6.

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 34, Friday, November 21.

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.

Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.

Maximum and Minimum Values (Section 3.1)

Presenter Name Presentation/event title xxxxx

MULTIPLES OF 2 By Preston, Lincoln and Blake. 2 X 1 =2 XX 2X1=2 1+1=2.

LP formulation of Economic Dispatch

(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.

Exponents 3² Mrs. 3 × Mrs. 3 3 × 3 3².

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

Integer Programming and Logic-Based Modeling Jan Fábry, Jan Pelikán ___________________________________________________________________________ MME 2003,

Lesson #3- Exponent Laws

Integer Programming Integer programming is a solution method for many discrete optimization problems Programming = Planning in this context Origins go.

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

3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.

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

Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.

Multiples of Nine.

EveMark Ed Enter question here. Click the sound icon to listen to each solution. Who has the best solution?

Divide by 8 page – groups of 8 Division Sentence 0 ÷ 8 = 0.

Notes 5IE 3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.

Solve x 2 +3x – 5 = 11 xx2x2 +3x-5X 2 +3x-5High/ Low L.

Warm-up Solve each system of equations:

6.1 - Polynomials. Monomial Monomial – 1 term Monomial – 1 term; a variable.

Optimization Problems

LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.

USING SETS IN LINGO What Are Sets? Sets are simply groups of related objects. A set might be a list of products, trucks, or employees. Each member in the.

Math 8 Unit 2: Integers. What you’ll learn: Multiply and divide integers Use the order of operations with integers Solve problems involving integers.

Example 15: A manufacturer has 4 warehouses and 5 vendors all in different cities. In the first warehouse there are 50 products, in the second warehouse.

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.

Multiplying with exponents

deterministic operations research

Stat 261 Two phase method.

Example 15: A manufacturer has 4 warehouses and 5 vendors all in different cities. In the first warehouse there are 50 products, in the second warehouse.

USING SETS IN LINGO What Are Sets?

Exponential Functions

Simplify 2m( 3 2 m+1)+3( 5 3 m-2) A.)3m2+5m-1 B.) 3 4 m m-6 C.) 3m2+7m-6 D.) 3 4 m m-1.

Solving Equations by Factoring and Problem Solving

Integer Programming Set up the mathematical programming problem to choose the set of capital investments to make that will maximize the Net Present Value.

Gamma Theta Upsilon Recent GTU Initiates

Presenter Name Presentation/event title xxxxx

Integer Programming (정수계획법)

Instructions and Examples Version 1.5

This condition occurs when the problem has incompatible constraints.

LINGO TUTORIAL 2.

Title—48 pt. Arial Bold (use two lines of text if necessary)

Integer Programming with What’sBest

Integer Programming with LINGO

7.5 – Constrained Optimization: The Method of Lagrange Multipliers

Integer Programming (정수계획법)

Algorithm Design Methods

ENGM 435/535 Integer Programming.

Advanced LP models column generation.

Title—48 pt. Arial Bold (use two lines of text if necessary)

Advanced LP models column generation.

Integer Programming with What’sBest

Warm up (12x2 + 8x – 6) – (9x2 – 2x + 5) Find the area and perimeter

Applied Statistical and Optimization Models

Presentation transcript:

Using Variable Domain Functions The variable domain functions are @GIN : It used for any positive integer value @BIN : It used for any binary value ( 0 or 1)

Example 1 Solve the following problem by LINGO MAX Z= 18X1+14X2+8X3+4X4 Subject to 15x1+12x2+7x3+4x4+x5 ≤ 37 x1,x2,x3,x4,x5 =(0,1)

Example 2 Suppose that we have 3 jobs (1, 2, 3) waiting for being performed and 3 machines (A, B, C) that can be used to perform these jobs. The assignment costs of the jobs to the machines are given in the following table. Find the minimum total cost one-to-one assignment between the jobs and the machines by using lingo programming.

Min z= 9x11+6x12+3x13+4x21+5x22+6x23+3x31+7x32+11x33 Subject to x11+x12+x13=1 x21+x22+x23=1 x31+x32+x33=1 x11+x21+x31=1 x12+x22+x31=1 x13+x23+x33=1 x11, x12,x13,x21,x22,x23,x31,x32 and x33 are binary variables

Example 3 Find the optimal solution by using LINGO Max z= 3x1+x2+3x3 Subject to -x1+2x2+x3≤4 4x2-3x3 ≤ 2 X1-3x2+2x3 ≤ 3 x1,x2 and x3 ≥ 0 and integer

Solve the following knapsack problem by using lingo software : Example 4 Solve the following knapsack problem by using lingo software : Maximize z= 5X1+3X2+8X3+9X4+4X5 Subject to 3X1+X2+5X3+4X4+X5=25 0≤X1 ≤2 , 0 ≤X2 ≤1 , 0 ≤X3 ≤4 , 0 ≤X4 ≤2, 0 ≤X5 ≤1 X1,X2,X3,X4,and X5 and integer.