Optimization: principles and algorithms, by Michel Bierlaire
run2513gomory.m
Go to the documentation of this file.
1 %> \file
2 %> Runs example 25.13 of \cite Bier15-book with Algorithm 26.3
3 %>
4 %> @note Calls \ref gomory
5 %>
6 %> @ingroup Running
7 %> @ingroup chap26
8 %> @author Michel Bierlaire
9 %> @date Tue Apr 14 10:14:53 2015
10 
11 A = [2 9 1 0 ; 11 -8 0 1 ] ;
12 b = [29 ; 79] ;
13 c = [-3 ; -13; 0 ; 0] ;
14 
15 [xopt, iter] = gomory(A,b,c)
16 
17 
function gomory(in A, in b, in c)
Solve an integer optimization problem by generating valid inequalities using a Gomory cut: subject t...
Copyright 2015-2016 Michel Bierlaire