A Surrogate cutting plane algorithm for all-integer programming

1985 ◽  
Vol 12 (3) ◽  
pp. 241-250 ◽  
Author(s):  
Larry M. Austin ◽  
Parviz Ghandforoush
Keyword(s):  
Integer Programming ◽  
Cutting Plane ◽  
Cutting Plane Algorithm

scholarly journals METODE PEMECAHAN MASALAH INTEGER PROGRAMMING

At-Taqaddum ◽  
2017 ◽  
Vol 7 (2) ◽  
pp. 211
Author(s):  
Siti Maslikhah
Keyword(s):  
Integer Programming ◽  
Problem Solving ◽  
Branch And Bound ◽  
Cutting Plane ◽  
Integer Solution ◽  
Cutting Plane Algorithm ◽  
Linear Programs ◽  
Error Level ◽  
Decision Variables ◽  
Integer Solutions

<em>Decision variables in the problem solving linear programs are often in the form of fractions. In some cases there are specific desires the solution in the form of an integer (integer). Integer solution is obtained by way of rounding does not warrant being in the area of fisibel. To obtain integer solutions, among others, by the method of Cutting Plane Algorithm or Branch and Bound. The advantages of the method of Cutting Plane Algorithm is quite effectively shorten the matter, while the advantages of the method of Branch and Bound the error level is to have a little but requires quite a long calculation.</em>

Sign in / Sign up

Export Citation Format

Share Document