# CPLEX Tutorial Handout

 To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video
Save this PDF as:

Size: px
Start display at page:

## Transcription

1 CPLEX Tutorial Handout What Is ILOG CPLEX? ILOG CPLEX is a tool for solving linear optimization problems, commonly referred to as Linear Programming (LP) problems, of the form: Maximize (or Minimize) c 1 x 1 + c 2 x c n x n subject to a 11 x 1 + a 12 x a 1n x n ~ b 1 a 21 x 1 + a 22 x a 2n x n ~ b 2... a m1 x 1 + a m2 x a mn x n ~ b m with these bounds l 1 x 1 u 1... l n x n u n where ~ can be,, or =, and the upper bounds u i and lower bounds l i may be positive infinity, negative infinity, or any real number. The elements of data you provide as input for this LP are: Objective function coefficients Constraint coefficients Right-hand sides Upper and lower bounds c 1, c 2,..., c n a 11, a 21,..., a n1... a m1, a m2,..., a mn b 1, b 2,..., b m u 1, u 2,..., u n and l 1, l 2,..., l n The optimal solution that ILOG CPLEX computes and returns is: Variables x 1, x 2,..., x n ILOG CPLEX also can solve several extensions to LP: Network Flow problems, a special case of LP that CPLEX can solve much faster by exploiting the problem structure. Quadratic Programming (QP) problems, where the LP objective function is expanded to include quadratic terms. Mixed Integer Programming (MIP) problems, where any or all of the LP or QP variables are further restricted to take integer values in the optimal solution and where MIP itself is extended to include constructs like Special Ordered Sets (SOS) and semi-continuous variables. ILOG CPLEX Components CPLEX comes in three forms to meet a wide range of users' needs: 1

2 The CPLEX Interactive Optimizer is an executable program that can read a problem interactively or from files in certain standard formats, solve the problem, and deliver the solution interactively or into text files. The program consists of the file cplex.exe on Windows platforms or cplex on UNIX platforms. Concert Technology is a set of C++, Java, and.net class libraries offering an API that includes modeling facilities to allow the programmer to embed CPLEX optimizers in C++, Java, or.net applications. The following table lists the files that contain the libraries. Microsoft Windows UNIX C++ ilocplex.lib concert.lib libilocplex.a libconcert.a Java cplex.jar cplex.jar C#.NET ILOG.CPLEX.dll ILOG.CONCERT.dll The CPLEX Callable Library is a C library that allows the programmer to embed ILOG CPLEX optimizers in applications written in C, Visual Basic, FORTRAN, or any other language that can call C functions.the library is provided in files cplex.lib and cplex.dll on Windows platforms, and in libcplex.a, libcplex.so, and libcplex.sl on UNIX platforms. Solving an LP with ILOG CPLEX The problem to be solved is: Maximize x1 + 2x2 + 3x3 subject to -x1 + x2 + x3 20 x1-3x2 + x3 30 with these bounds 0 x x2 + 0 x3 + Using the Interactive Optimizer The following sample is screen output from a CPLEX Interactive Optimizer session where the model of an example is entered and solved. CPLEX> indicates the CPLEX prompt, and text following this prompt is user input. Welcome to CPLEX Interactive Optimizer with Simplex, Mixed Integer & Barrier Optimizers Copyright (c) ILOG CPLEX is a registered trademark of ILOG Type 'help' for a list of available commands. Type 'help' followed by a command name for more information on commands. CPLEX> enter example Enter new problem ['end' on a separate line terminates]: maximize x1 + 2 x2 + 3 x3 2

3 subject to -x1 + x2 + x3 <= 20 x1-3 x2 + x3 <=30 bounds 0 <= x1 <= 40 0 <= x2 0 <= x3 end CPLEX> optimize Tried aggregator 1 time. No LP presolve or aggregator reductions. Presolve time = 0.00 sec. Iteration log... Iteration: 1 Dual infeasibility = Iteration: 2 Dual objective = Dual simplex - Optimal: Objective = e+002 Solution time = 0.01 sec. Iterations = 2 (1) CPLEX> display solution variables x1-x3 Variable Name Solution Value x x x CPLEX> quit Concert Technology for Java Users Creating a model Solving that model Querying results after solving Handling error conditions ILOG Concert Technology allows your application to call ILOG CPLEX directly. This Java interface supplies a rich means for you to use Java objects to build your optimization model. The IloCplex class implements the ILOG Concert Technology interface for creating variables and constraints. It also provides functionality for solving Mathematical Programing (MP) problems and accessing solution information. Compiling ILOG CPLEX Applications in ILOG Concert Technology For this, you add the cplex.jar file to your classpath. This is most easily done by passing the commandline option to the Java compiler javac: -classpath <path_to_cplex.jar> In the java command line, the following should be added. -Djava.library.path=<path_to_shared_library> 3

4 See the makefile at The Anatomy of an ILOG Concert Technology Application To use the ILOG CPLEX Java interfaces, you need to import the appropriate packages into your application. This is done with the lines: import ilog.concert.*; import ilog.cplex.*; As for every Java application, an ILOG CPLEX application is implemented as a method of a class. In this discussion, the method will be the static main method. The first task is to create an IloCplex object. It is used to create all the modeling objects needed to represent the model. For example, an integer variable with bounds 0 and 10 is created by calling cplex.intvar(0, 10), where cplex is the IloCplex object. Since Java error handling in ILOG CPLEX uses exceptions, you should include the ILOG Concert Technology part of an application in a try/catch statement. All the exceptions thrown by any ILOG Concert Technology method are derived from IloException. Thus IloException should be caught in the catch statement. In summary, here is the structure of a Java application that calls ILOG CPLEX: import ilog.concert.*; import ilog.cplex.*; static public class Application { static public main(string[] args) { try { IloCplex cplex = new IloCplex(); // create model and solve it catch (IloException e) { System.err.println("Concert exception caught: " + e); Create the Model The IloCplex object provides the functionality to create an optimization model that can be solved with IloCplex. The interface functions for doing so are defined by the ILOG Concert Technology interface IloModeler and its extension IloMPModeler. These interfaces define the constructor functions for modeling objects of the following types, which can be used with IloCplex: IloNumVar modeling variables IloRange IloObjective IloNumExpr ranged constraints of the type lb <= expr <= ub optimization objective expression using variables Modeling variables are represented by objects implementing the IloNumVar interface defined by ILOG Concert Technology. Here is how to create three continuous variables, all with bounds 0 and 100: IloNumVar[] x = cplex.numvararray(3, 0.0, 100.0); There is a wealth of other functions for creating arrays or individual modeling variables. The documentation for IloModeler and IloMPModeler will give you the complete list. 4

5 Modeling variables are typically used to build expressions, of type IloNumExpr, for use in constraints or the objective function of an optimization model. For example the expression: x[0] + 2*x[1] + 3*x[2] can be created like this: IloNumExpr expr = cplex.sum(x[0], cplex.prod(2.0, x[1]), cplex.prod(3.0, x[2])); Another way of creating an object representing the same expression is to use an IloLinearNumExpr expression. Here is how: IloLinearNumExpr expr = cplex.linearnumexpr(); expr.addterm(1.0, x[0]); expr.addterm(2.0, x[1]); expr.addterm(3.0, x[2]); The advantage of using IloLinearNumExpr over the first way is that you can more easily build up your linear expression in a loop, which is what is typically needed in more complex applications. Interface IloLinearNumExpr is an extension of IloNumExpr, and thus can be used anywhere an expression can be used. As mentioned before, expressions can be used to create constraints or an objective function for a model. Here is how to create a minimization objective for the above expression: IloObjective obj = cplex.minimize(expr); In addition to creating an objective, IloCplex must be instructed to use it in the model it solves. This is done by adding the objective to IloCplex via: cplex.add(obj); Every modeling object that is to be used in a model must be added to the IloCplex object. The variables need not be explicitly added as they are treated implicitly when used in the expression of the objective. More generally, every modeling object that is referenced by another modeling object which itself has been added to IloCplex, is implicitly added to IloCplex as well. There is a shortcut notation for creating and adding the objective to IloCplex: cplex.addminimize(expr); Since the objective is not otherwise accessed, it does not need to be stored in the variable obj. Adding constraints to the model is just as easy. For example, the constraint -x[0] + x[1] + x[2] <= 20.0 can be added by calling: cplex.addle(cplex.sum(cplex.negative(x[0]), x[1], x[2]), 20); Again, many methods are provided for adding other constraint types, including equality constraints, greater than or equal to constraints, and ranged constraints. Internally, they are all represented as IloRange objects with appropriate choices of bounds, which is why all these methods return IloRange objects. Also, note that the expressions above could have been created in many different ways, including the use of IloLinearNumExpr. Solve the Model IloCplex.solve() IloCplex.solveRelaxed() IloCplex.getStatus. The returned value tells you what ILOG CPLEX found out about the model: whether it found the optimal solution or only a feasible solution, whether it proved the model to be unbounded or infeasible, or whether 5

6 nothing at all has been determined at this point. Even more detailed information about the termination of the solver call is available through the method IloCplex.getCplexStatus. Query the Results If the solve method succeeded in finding a solution, you will then want to access that solution. The objective value of that solution can be queried using a statement like this: double objval = cplex.getobjvalue(); Similarly, solution values for all the variables in the array x can be queried by calling: double[] xval = cplex.getvalues(x); More solution information can be queried from IloCplex, including slacks and, depending on the algorithm that was applied for solving the model, duals, reduced cost information, and basis information. Building and Solving a Small LP Model in Java The example LPex1.java, part of the standard distribution of ILOG CPLEX, is a program that builds a specific small LP model and then solves it. This example follows the general structure found in many ILOG CPLEX Concert Technology applications, and demonstrates three main ways to construct a model: Modeling by Rows; Modeling by Columns; Example LPex1.java Maximize x1 + 2x2 + 3x3 subject to -x1 + x2 + x3 20 x1-3x2 + x3 30 with these bounds 0 x x2 + 0 x3 + Program for building and solving the example import ilog.concert.*; import ilog.cplex.*; public class Example { public static void main(string[] args) { try { IloCplex cplex = new IloCplex(); double[] lb = {0.0, 0.0, 0.0; double[] ub = {40.0, Double.MAX_VALUE, Double.MAX_VALUE; IloNumVar[] x = cplex.numvararray(3, lb, ub); double[] objvals = {1.0, 2.0, 3.0; 6

7 cplex.addmaximize(cplex.scalprod(x, objvals)); cplex.addle(cplex.sum(cplex.prod(-1.0, x[0]), cplex.prod( 1.0, x[1]), cplex.prod( 1.0, x[2])), 20.0); cplex.addle(cplex.sum(cplex.prod( 1.0, x[0]), cplex.prod(-3.0, x[1]), cplex.prod( 1.0, x[2])), 30.0); if ( cplex.solve() ) { cplex.out().println("solution status = " + cplex.getstatus()); cplex.out().println("solution value = " + cplex.getobjvalue()); double[] val = cplex.getvalues(x); int ncols = cplex.getncols(); for (int j = 0; j < ncols; ++j) cplex.out().println("column: " + j + " Value = " + val[j]); cplex.end(); catch (IloException e) { System.err.println("Concert exception '" + e + "' caught"); Compile and run % javac example.java % java example or if you use makefile % make Complete Code of LPex1.java // // File: examples/src/lpex1.java // Version 9.0 // // Copyright (C) by ILOG. // All Rights Reserved. // Permission is expressly granted to use this example in the // course of developing applications that use ILOG products. // // // LPex1.java - Entering and optimizing an LP problem // // Demonstrates different methods for creating a problem. The user has to // choose the method on the command line: 7

8 // // java LPex1 -r generates the problem by adding constraints // java LPex1 -c generates the problem by adding variables // java LPex1 -n generates the problem by adding expressions // import ilog.concert.*; import ilog.cplex.*; public class LPex1 { static void usage() { System.out.println("usage: LPex1 <option>"); System.out.println("options: -r build model row by row"); System.out.println("options: -c build model column by column"); System.out.println("options: -n build model nonzero by nonzero"); public static void main(string[] args) { if ( args.length!= 1 args[0].charat(0)!= `-' ) { usage(); return; try { // Create the modeler/solver object IloCplex cplex = new IloCplex(); IloNumVar[][] var = new IloNumVar[1][]; IloRange[][] rng = new IloRange[1][]; // Evaluate command line option and call appropriate populate method. // The created ranges and variables are returned as element 0 of arrays // var and rng. switch ( args[0].charat(1) ) { case `r': populatebyrow(cplex, var, rng); break; case `c': populatebycolumn(cplex, var, rng); break; case `n': populatebynonzero(cplex, var, rng); break; default: usage(); return; // write model to file cplex.exportmodel("lpex1.lp"); // solve the model and display the solution if one was found if ( cplex.solve() ) { double[] x = cplex.getvalues(var[0]); double[] dj = cplex.getreducedcosts(var[0]); double[] pi = cplex.getduals(rng[0]); double[] slack = cplex.getslacks(rng[0]); cplex.output().println("solution status = " + cplex.getstatus()); cplex.output().println("solution value = " + cplex.getobjvalue()); int ncols = cplex.getncols(); for (int j = 0; j < ncols; ++j) { 8

9 cplex.output().println("column: " + j + " Value = " + x[j] + " Reduced cost = " + dj[j]); int nrows = cplex.getnrows(); for (int i = 0; i < nrows; ++i) { cplex.output().println("row : " + i + " Slack = " + slack[i] + " Pi = " + pi[i]); cplex.end(); catch (IloException e) { System.err.println("Concert exception `" + e + "` caught"); // The following methods all populate the problem with data for the following // linear program: // // Maximize // x1 + 2 x2 + 3 x3 // Subject To // - x1 + x2 + x3 <= 20 // x1-3 x2 + x3 <= 30 // Bounds // 0 <= x1 <= 40 // End // // using the IloMPModeler API static void populatebyrow(ilompmodeler model, IloNumVar[][] var, IloRange[][] rng) throws IloException { double[] lb = {0.0, 0.0, 0.0; double[] ub = {40.0, Double.MAX_VALUE, Double.MAX_VALUE; IloNumVar[] x = model.numvararray(3, lb, ub); var[0] = x; double[] objvals = {1.0, 2.0, 3.0; model.addmaximize(model.scalprod(x, objvals)); rng[0] = new IloRange[2]; rng[0][0] = model.addle(model.sum(model.prod(-1.0, x[0]), model.prod( 1.0, x[1]), model.prod( 1.0, x[2])), 20.0); rng[0][1] = model.addle(model.sum(model.prod( 1.0, x[0]), model.prod(-3.0, x[1]), model.prod( 1.0, x[2])), 30.0); static void populatebycolumn(ilompmodeler model, IloNumVar[][] var, IloRange[][] rng) throws IloException { IloObjective obj = model.addmaximize(); rng[0] = new IloRange[2]; rng[0][0] = model.addrange(-double.max_value, 20.0); 9

10 rng[0][1] = model.addrange(-double.max_value, 30.0); IloRange r0 = rng[0][0]; IloRange r1 = rng[0][1]; var[0] = new IloNumVar[3]; var[0][0] = model.numvar(model.column(obj, 1.0).and( model.column(r0, -1.0).and( model.column(r1, 1.0))), 0.0, 40.0); var[0][1] = model.numvar(model.column(obj, 2.0).and( model.column(r0, 1.0).and( model.column(r1, -3.0))), 0.0, Double.MAX_VALUE); var[0][2] = model.numvar(model.column(obj, 3.0).and( model.column(r0, 1.0).and( model.column(r1, 1.0))), 0.0, Double.MAX_VALUE); static void populatebynonzero(ilompmodeler model, IloNumVar[][] var, IloRange[][] rng) throws IloException { double[] lb = {0.0, 0.0, 0.0; double[] ub = {40.0, Double.MAX_VALUE, Double.MAX_VALUE; IloNumVar[] x = model.numvararray(3, lb, ub); var[0] = x; double[] objvals = {1.0, 2.0, 3.0; model.add(model.maximize(model.scalprod(x, objvals))); rng[0] = new IloRange[2]; rng[0][0] = model.addrange(-double.max_value, 20.0); rng[0][1] = model.addrange(-double.max_value, 30.0); rng[0][0].setexpr(model.sum(model.prod(-1.0, x[0]), model.prod( 1.0, x[1]), model.prod( 1.0, x[2]))); rng[0][1].setexpr(model.sum(model.prod( 1.0, x[0]), model.prod(-3.0, x[1]), model.prod( 1.0, x[2]))); 10

### IBM ILOG CPLEX Optimization Studio Getting Started with CPLEX. Version12Release4

IBM ILOG CPLEX Optimization Studio Getting Started with CPLEX Version12Release4 Copyright notice Describes general use restrictions and trademarks related to this document and the software described in

### Using CPLEX. =5 has objective value 150.

Using CPLEX CPLEX is optimization software developed and sold by ILOG, Inc. It can be used to solve a variety of different optimization problems in a variety of computing environments. Here we will discuss

### IBM ILOG CPLEX for Microsoft Excel User's Manual

IBM ILOG CPLEX V12.1 IBM ILOG CPLEX for Microsoft Excel User's Manual Copyright International Business Machines Corporation 1987, 2009 US Government Users Restricted Rights - Use, duplication or disclosure

### Stanford University CS261: Optimization Handout 6 Luca Trevisan January 20, In which we introduce the theory of duality in linear programming.

Stanford University CS261: Optimization Handout 6 Luca Trevisan January 20, 2011 Lecture 6 In which we introduce the theory of duality in linear programming 1 The Dual of Linear Program Suppose that we

### Introduction to Object-Oriented Programming

Introduction to Object-Oriented Programming Programs and Methods Christopher Simpkins chris.simpkins@gatech.edu CS 1331 (Georgia Tech) Programs and Methods 1 / 8 The Anatomy of a Java Program It is customary

### Java CPD (I) Frans Coenen Department of Computer Science

Java CPD (I) Frans Coenen Department of Computer Science Content Session 1, 12:45-14:30 (First Java Programme, Inheritance, Arithmetic) Session 2, 14:45-16:45 (Input and Programme Constructs) Materials

### 4.6 Linear Programming duality

4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal

### Chapter 1: Introducing Java

Chapter 1: Introducing Java 1. What is Java? Java is a programming language offering many features that make it attractive for mathematical illustration. First, it is a high-level language providing a

### Using computing resources with IBM ILOG CPLEX CO@W2015

CPLEX Optimization IBM Germany 2015-10-06 Using computing resources with IBM ILOG CPLEX CO@W2015 Hardware resources Multiple cores/threads Multiple machines No machines Software resources Interfacing with

### GUROBI OPTIMIZER QUICK START GUIDE. Version 6.0, Copyright c 2014, Gurobi Optimization, Inc.

GUROBI OPTIMIZER QUICK START GUIDE Version 6.0, Copyright c 2014, Gurobi Optimization, Inc. Contents 1 Introduction 4 2 Obtaining a Gurobi License 6 2.1 Creating a new academic license.............................

### How to speed-up hard problem resolution using GLPK?

How to speed-up hard problem resolution using GLPK? Onfroy B. & Cohen N. September 27, 2010 Contents 1 Introduction 2 1.1 What is GLPK?.......................................... 2 1.2 GLPK, the best one?.......................................

### Definition of a Linear Program

Definition of a Linear Program Definition: A function f(x 1, x,..., x n ) of x 1, x,..., x n is a linear function if and only if for some set of constants c 1, c,..., c n, f(x 1, x,..., x n ) = c 1 x 1

### Interactive Applications (CLI) and Math

Interactive Applications (CLI) and Math Interactive Applications Command Line Interfaces The Math Class Example: Solving Quadratic Equations Example: Factoring the Solution Reading for this class: L&L,

### An Incomplete C++ Primer. University of Wyoming MA 5310

An Incomplete C++ Primer University of Wyoming MA 5310 Professor Craig C. Douglas http://www.mgnet.org/~douglas/classes/na-sc/notes/c++primer.pdf C++ is a legacy programming language, as is other languages

### Algebraic Simplex Method - Introduction Previous

Algebraic Simplex Method - Introduction To demonstrate the simplex method, consider the following linear programming model: This is the model for Leo Coco's problem presented in the demo, Graphical Method.

### Simplex method summary

Simplex method summary Problem: optimize a linear objective, subject to linear constraints 1. Step 1: Convert to standard form: variables on right-hand side, positive constant on left slack variables for

### Linear Program Solver

Linear Program Solver Help Manual prepared for Forest Management course by Bogdan Strimbu 1 Introduction The Linear Program Solver (LiPS) Help manual was developed to help students enrolled in the senior

### AP Computer Science Java Subset

APPENDIX A AP Computer Science Java Subset The AP Java subset is intended to outline the features of Java that may appear on the AP Computer Science A Exam. The AP Java subset is NOT intended as an overall

### Using the Simplex Method in Mixed Integer Linear Programming

Integer Using the Simplex Method in Mixed Integer UTFSM Nancy, 17 december 2015 Using the Simplex Method in Mixed Integer Outline Mathematical Programming Integer 1 Mathematical Programming Optimisation

### Chapter 6: Sensitivity Analysis

Chapter 6: Sensitivity Analysis Suppose that you have just completed a linear programming solution which will have a major impact on your company, such as determining how much to increase the overall production

### IBM ILOG CPLEX Optimization Studio Getting Started with CPLEX. Version 12 Release 6

IBM ILOG CPLEX Optimization Studio Getting Started with CPLEX Version 12 Release 6 IBM ILOG CPLEX Optimization Studio Getting Started with CPLEX Version 12 Release 6 Copyright notice Describes general

### JDK 1.5 Updates for Introduction to Java Programming with SUN ONE Studio 4

JDK 1.5 Updates for Introduction to Java Programming with SUN ONE Studio 4 NOTE: SUN ONE Studio is almost identical with NetBeans. NetBeans is open source and can be downloaded from www.netbeans.org. I

### Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents

### Java Software Development Kit (JDK 5.0 Update 14) Installation Step by Step Instructions

Java Software Development Kit (JDK 5.0 Update 14) Installation Step by Step Instructions 1. Click the download link Download the Java Software Development Kit (JDK 5.0 Update 14) from Sun Microsystems

### 8/31/2012. Object Oriented Software Development. C# classes. C# example class code

Object Oriented Software Development 3. Creating C# classes C# classes Create an OO program by writing classes Need to understand structure and syntax of C# classes Programming language syntax is the set

### Open-source Quality Assurance and Performance Analysis Tools

Open-source Quality Assurance and Performance Analysis Tools Armin Pruessner, Michael Bussieck, Steven Dirkse, Stefan Vigerske GAMS Development Corporation 1217 Potomac Street NW Washington, DC 20007 1

### Linear Programming with Post-Optimality Analyses

Linear Programming with Post-Optimality Analyses Wilson Problem: Wilson Manufacturing produces both baseballs and softballs, which it wholesales to vendors around the country. Its facilities permit the

### Using C++ with CPLEX

Using C++ with CPLEX Daniel Simmons, Dr. Qipeng Phil Zheng Department of Industrial and Management Systems Engineering West Virginia University Nonlinear Programming, Summer 2012 D. A. Simmons (IMSE@WVU)

### Linear Programming: Chapter 5 Duality

Linear Programming: Chapter 5 Duality Robert J. Vanderbei October 17, 2007 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544 http://www.princeton.edu/ rvdb Resource

### The Simplex Solution Method

Module A The Simplex Solution Method A-1 A-2 Module A The Simplex Solution Method The simplex method is a general mathematical solution technique for solving linear programming problems. In the simplex

### Cloud Branching. Timo Berthold. joint work with Domenico Salvagnin (Università degli Studi di Padova)

Cloud Branching Timo Berthold Zuse Institute Berlin joint work with Domenico Salvagnin (Università degli Studi di Padova) DFG Research Center MATHEON Mathematics for key technologies 21/May/13, CPAIOR

### Java Interview Questions and Answers

1. What is the most important feature of Java? Java is a platform independent language. 2. What do you mean by platform independence? Platform independence means that we can write and compile the java

### Computing Concepts with Java Essentials

2008 AGI-Information Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. Computing Concepts with Java Essentials 3rd Edition Cay Horstmann

### 6. Mixed Integer Linear Programming

6. Mixed Integer Linear Programming Javier Larrosa Albert Oliveras Enric Rodríguez-Carbonell Problem Solving and Constraint Programming (RPAR) Session 6 p.1/40 Mixed Integer Linear Programming A mixed

### Crash Course in Java

Crash Course in Java Based on notes from D. Hollinger Based in part on notes from J.J. Johns also: Java in a Nutshell Java Network Programming and Distributed Computing Netprog 2002 Java Intro 1 What is

### Using EXCEL Solver October, 2000

Using EXCEL Solver October, 2000 2 The Solver option in EXCEL may be used to solve linear and nonlinear optimization problems. Integer restrictions may be placed on the decision variables. Solver may be

### LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA Hyderabad

LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA 98481 85073 Hyderabad Page 1 of 19 Question: Explain LPP. Answer: Linear programming is a mathematical technique for determining the optimal allocation of resources

### Searching Algorithms

Searching Algorithms The Search Problem Problem Statement: Given a set of data e.g., int [] arr = {10, 2, 7, 9, 7, 4}; and a particular value, e.g., int val = 7; Find the first index of the value in the

### Chap 4 The Simplex Method

The Essence of the Simplex Method Recall the Wyndor problem Max Z = 3x 1 + 5x 2 S.T. x 1 4 2x 2 12 3x 1 + 2x 2 18 x 1, x 2 0 Chap 4 The Simplex Method 8 corner point solutions. 5 out of them are CPF solutions.

### How to Install Java onto your system

How to Install Java onto your system 1. In your browser enter the URL: Java SE 2. Choose: Java SE Downloads Java Platform (JDK) 7 jdk-7- windows-i586.exe. 3. Accept the License Agreement and choose the

### Third AP Edition. Object-Oriented Programming and Data Structures. Maria Litvin. Gary Litvin. Phillips Academy, Andover, Massachusetts

Third AP Edition Object-Oriented Programming and Data Structures Maria Litvin Phillips Academy, Andover, Massachusetts Gary Litvin Skylight Software, Inc. Skylight Publishing Andover, Massachusetts Skylight

### Solving Linear Programs using Microsoft EXCEL Solver

Solving Linear Programs using Microsoft EXCEL Solver By Andrew J. Mason, University of Auckland To illustrate how we can use Microsoft EXCEL to solve linear programming problems, consider the following

### The Gurobi Optimizer

The Gurobi Optimizer Gurobi History Gurobi Optimization, founded July 2008 Zonghao Gu, Ed Rothberg, Bob Bixby Started code development March 2008 Gurobi Version 1.0 released May 2009 History of rapid,

### 6.1. Example: A Tip Calculator 6-1

Chapter 6. Transition to Java Not all programming languages are created equal. Each is designed by its creator to achieve a particular purpose, which can range from highly focused languages designed for

### Noncommercial Software for Mixed-Integer Linear Programming

Noncommercial Software for Mixed-Integer Linear Programming J. T. Linderoth T. K. Ralphs December, 2004. Revised: January, 2005. Abstract We present an overview of noncommercial software tools for the

### Moving from CS 61A Scheme to CS 61B Java

Moving from CS 61A Scheme to CS 61B Java Introduction Java is an object-oriented language. This document describes some of the differences between object-oriented programming in Scheme (which we hope you

### Java Application Developer Certificate Program Competencies

Java Application Developer Certificate Program Competencies After completing the following units, you will be able to: Basic Programming Logic Explain the steps involved in the program development cycle

### First Java Programs. V. Paúl Pauca. CSC 111D Fall, 2015. Department of Computer Science Wake Forest University. Introduction to Computer Science

First Java Programs V. Paúl Pauca Department of Computer Science Wake Forest University CSC 111D Fall, 2015 Hello World revisited / 8/23/15 The f i r s t o b l i g a t o r y Java program @author Paul Pauca

### CS/COE 1501 http://cs.pitt.edu/~bill/1501/

CS/COE 1501 http://cs.pitt.edu/~bill/1501/ Lecture 01 Course Introduction Meta-notes These notes are intended for use by students in CS1501 at the University of Pittsburgh. They are provided free of charge

Advanced Features Trenton Computer Festival May 1 sstt & 2 n d,, 2004 Michael P.. Redlich Senior Research Technician ExxonMobil Research & Engineering michael..p..redlich@exxonmobil..com Table of Contents

### Chulalongkorn University International School of Engineering Department of Computer Engineering 2140105 Computer Programming Lab.

Chulalongkorn University Name International School of Engineering Student ID Department of Computer Engineering Station No. 2140105 Computer Programming Lab. Date Lab 2 Using Java API documents, command

### Evaluation. Copy. Evaluation Copy. Chapter 7: Using JDBC with Spring. 1) A Simpler Approach... 7-2. 2) The JdbcTemplate. Class...

Chapter 7: Using JDBC with Spring 1) A Simpler Approach... 7-2 2) The JdbcTemplate Class... 7-3 3) Exception Translation... 7-7 4) Updating with the JdbcTemplate... 7-9 5) Queries Using the JdbcTemplate...

### The OptQuest Engine Java and.net Developer's Guilde

The OptQuest Engine Java and.net Developer's Guilde Table Of Contents Introduction to optimization... 1 What is optimization?... 1 How the OptQuest Engine works... 1 Using the documentation... 2 Platforms...

### Creating a Simple, Multithreaded Chat System with Java

Creating a Simple, Multithreaded Chat System with Java Introduction by George Crawford III In this edition of Objective Viewpoint, you will learn how to develop a simple chat system. The program will demonstrate

### Spreadsheets have become the principal software application for teaching decision models in most business

Vol. 8, No. 2, January 2008, pp. 89 95 issn 1532-0545 08 0802 0089 informs I N F O R M S Transactions on Education Teaching Note Some Practical Issues with Excel Solver: Lessons for Students and Instructors

### Supplement IV.C: Tutorial for Oracle. For Introduction to Java Programming By Y. Daniel Liang

Supplement IV.C: Tutorial for Oracle For Introduction to Java Programming By Y. Daniel Liang This supplement covers the following topics: Connecting and Using Oracle Creating User Accounts Accessing Oracle

### Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs

Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs These questions are from previous years and should you give you some idea of what to expect on Quiz 1. 1. Consider the

### Getting Started with the Internet Communications Engine

Getting Started with the Internet Communications Engine David Vriezen April 7, 2014 Contents 1 Introduction 2 2 About Ice 2 2.1 Proxies................................. 2 3 Setting Up ICE 2 4 Slices 2

### Programmierpraktikum

Programmierpraktikum Claudius Gros, SS2012 Institut für theoretische Physik Goethe-University Frankfurt a.m. 1 of 21 10/16/2012 09:29 AM Java - A First Glance 2 of 21 10/16/2012 09:29 AM programming languages

### 1. Setting up a small sample model to be solved by LINDO. 5. How do solve LP with Unrestricted variables (i.e. non-standard form)?

Contents: 1. Setting up a small sample model to be solved by LINDO 2. How to prepare the model to be solved by LINDO? 3. How to Enter the (input) Model to LINDO [Windows]? 4. How do I Print my work or

### Tutorial on Writing Modular Programs in Scala

Tutorial on Writing Modular Programs in Scala Martin Odersky and Gilles Dubochet 13 September 2006 Tutorial on Writing Modular Programs in Scala Martin Odersky and Gilles Dubochet 1 of 45 Welcome to the

### Graphical method. plane. (for max) and down (for min) until it touches the set of feasible solutions. Graphical method

The graphical method of solving linear programming problems can be applied to models with two decision variables. This method consists of two steps (see also the first lecture): 1 Draw the set of feasible

### Object-Oriented Programming in Java

CSCI/CMPE 3326 Object-Oriented Programming in Java Class, object, member field and method, final constant, format specifier, file I/O Dongchul Kim Department of Computer Science University of Texas Rio

### SBB: A New Solver for Mixed Integer Nonlinear Programming

SBB: A New Solver for Mixed Integer Nonlinear Programming Michael R. Bussieck GAMS Development Corp. Arne S. Drud ARKI Consulting & Development A/S OR2001, Duisburg Overview! SBB = Simple Branch & Bound!

### Specialized Android APP Development Program with Java (SAADPJ) Duration 2 months

Specialized Android APP Development Program with Java (SAADPJ) Duration 2 months Our program is a practical knowledge oriented program aimed at making innovative and attractive applications for mobile

### Preet raj Core Java and Databases CS4PR. Time Allotted: 3 Hours. Final Exam: Total Possible Points 75

Preet raj Core Java and Databases CS4PR Time Allotted: 3 Hours Final Exam: Total Possible Points 75 Q1. What is difference between overloading and overriding? 10 points a) In overloading, there is a relationship

### Demo: Controlling.NET Windows Forms from a Java Application. Version 7.3

Demo: Controlling.NET Windows Forms from a Java Application Version 7.3 JNBridge, LLC www.jnbridge.com COPYRIGHT 2002 2015 JNBridge, LLC. All rights reserved. JNBridge is a registered trademark and JNBridgePro

### Fundamentals of Java Programming

Fundamentals of Java Programming This document is exclusive property of Cisco Systems, Inc. Permission is granted to print and copy this document for non-commercial distribution and exclusive use by instructors

### Chapter 5: Solving General Linear Programs

Chapter 5: Solving General Linear Programs So far we have concentrated on linear programs that are in standard form, which have a maximization objective, all constraints of type, all of the right hand

### Java Memory Management

Java Memory Management 1 Tracing program execution Trace: To follow the course or trail of. When you need to find and fix a bug or have to understand a tricky piece of code that your coworker wrote, you

### IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2

IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3

### Supplement IV.D: Tutorial for MS Access. For Introduction to Java Programming By Y. Daniel Liang

Supplement IV.D: Tutorial for MS Access For Introduction to Java Programming By Y. Daniel Liang This supplement covers the following topics: Creating Databases and Executing SQL Creating ODBC Data Source

### Nonlinear Programming Methods.S2 Quadratic Programming

Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective

### Package lpsolve. September 19, 2015

Package lpsolve September 19, 2015 Version 5.6.13 Date 2015-09-18 Title Interface to 'Lp_solve' v. 5.5 to Solve Linear/Integer Programs Author Michel Berkelaar and others Maintainer Samuel E. Buttrey

Programming Exercise / ILOG CPLEX Tutorial Andreas M. Chwatal Algorithms and Data Structures Group Institute of Computer Graphics and Algorithms Vienna University of Technology VU Fortgeschrittene Algorithmen

### Working With Derby. Version 10.2 Derby Document build: December 11, 2006, 7:06:09 AM (PST)

Working With Derby Version 10.2 Derby Document build: December 11, 2006, 7:06:09 AM (PST) Contents Copyright...3 Introduction and prerequisites...4 Activity overview... 5 Activity 1: Run SQL using the

### Introduction to HP ArcSight ESM Web Services APIs

Introduction to HP ArcSight ESM Web Services APIs Shivdev Kalambi Software Development Manager (Correlation Team) #HPProtect Agenda Overview Some applications of APIs ESM Web Services APIs Login Service

### Capabilities of a Java Test Execution Framework by Erick Griffin

Capabilities of a Java Test Execution Framework by Erick Griffin Here we discuss key properties and capabilities of a Java Test Execution Framework for writing and executing discrete Java tests for testing

### TECH TUTORIAL: EMBEDDING ANALYTICS INTO A DATABASE USING SOURCEPRO AND JMSL

TECH TUTORIAL: EMBEDDING ANALYTICS INTO A DATABASE USING SOURCEPRO AND JMSL This white paper describes how to implement embedded analytics within a database using SourcePro and the JMSL Numerical Library,

### problem is to maximize 2x1 +4x2 +3x3 + x4 subject to: 3x1 + x2 + x3 + 4x4» 12 x1 3x2 + 2x3 + 3x4» 7 2x1 + x2 + 3x3 x4» 10 x 0 : I set up the sample te

Linear Programming Notes IV: Solving Linear Programming Problems Using Excel 1 Introduction Software that solves moderately large linear programming problems is readily available. You can find programs

### Branch, Cut, and Price: Sequential and Parallel

Branch, Cut, and Price: Sequential and Parallel T.K. Ralphs 1, L. Ladányi 2, and L.E. Trotter, Jr. 3 1 Department of Industrial and Manufacturing Systems Engineering, Lehigh University, Bethlehem, PA 18017,

### Optimization applications in finance, securities, banking and insurance

IBM Software IBM ILOG Optimization and Analytical Decision Support Solutions White Paper Optimization applications in finance, securities, banking and insurance 2 Optimization applications in finance,

### Mixed Integer Linear Programming in R

Mixed Integer Linear Programming in R Stefan Theussl Department of Statistics and Mathematics Wirtschaftsuniversität Wien July 1, 2008 Outline Introduction Linear Programming Quadratic Programming Mixed

### Java Web Services SDK

Java Web Services SDK Version 1.5.1 September 2005 This manual and accompanying electronic media are proprietary products of Optimal Payments Inc. They are to be used only by licensed users of the product.

### Example of a Java program

Example of a Java program class SomeNumbers static int square (int x) return x*x; public static void main (String[] args) int n=20; if (args.length > 0) // change default n = Integer.parseInt(args[0]);

### A Constraint Programming based Column Generation Approach to Nurse Rostering Problems

Abstract A Constraint Programming based Column Generation Approach to Nurse Rostering Problems Fang He and Rong Qu The Automated Scheduling, Optimisation and Planning (ASAP) Group School of Computer Science,

### Java Coding Practices for Improved Application Performance

1 Java Coding Practices for Improved Application Performance Lloyd Hagemo Senior Director Application Infrastructure Management Group Candle Corporation In the beginning, Java became the language of the

### Web development... the server side (of the force)

Web development... the server side (of the force) Fabien POULARD Document under license Creative Commons Attribution Share Alike 2.5 http://www.creativecommons.org/learnmore Web development... the server

### Lecture 4 Linear Programming Models: Standard Form. August 31, 2009

Linear Programming Models: Standard Form August 31, 2009 Outline: Lecture 4 Standard form LP Transforming the LP problem to standard form Basic solutions of standard LP problem Operations Research Methods

### max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x

Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study

### Building Applications Using Micro Focus COBOL

Building Applications Using Micro Focus COBOL Abstract If you look through the Micro Focus COBOL documentation, you will see many different executable file types referenced: int, gnt, exe, dll and others.

### A short OPL tutorial

A short OPL tutorial Truls Flatberg January 17, 2009 1 Introduction This note is a short tutorial to the modeling language OPL. The tutorial is by no means complete with regard to all features of OPL.

### Continuous Integration Part 2

1 Continuous Integration Part 2 This blog post is a follow up to my blog post Continuous Integration (CI), in which I described how to execute test cases in Code Tester (CT) in a CI environment. What I

### 1001ICT Introduction To Programming Lecture Notes

1001ICT Introduction To Programming Lecture Notes School of Information and Communication Technology Griffith University Semester 2, 2015 1 3 A First MaSH Program In this section we will describe a very

### Free Java textbook available online. Introduction to the Java programming language. Compilation. A simple java program

Free Java textbook available online "Thinking in Java" by Bruce Eckel, 4th edition, 2006, ISBN 0131872486, Pearson Education Introduction to the Java programming language CS 4354 Summer II 2015 The third

### Special Situations in the Simplex Algorithm

Special Situations in the Simplex Algorithm Degeneracy Consider the linear program: Maximize 2x 1 +x 2 Subject to: 4x 1 +3x 2 12 (1) 4x 1 +x 2 8 (2) 4x 1 +2x 2 8 (3) x 1, x 2 0. We will first apply the