Binary Integer Programming - creado desde un Mapa Mental

Page 1

Concept

Solving Algorithms

Applications

Advantages

Software

Disadvantages

Variables

Main Objective

Restricted to be either 0 or 1

N-th variables are taken in decision values

Decision-making

Egon Balas' Additive Method

Implicit Enumeration

Branch and Bound

Check the initial solution (0,0,..,0)

Branching

Ending Solution

Sounding

When

ZMax = ∞

K = 0

Create two new partial solutions

xk+1=1

xk+1=0 and k=k+1

if Z< ZMax then ZMax=Z

End of solution

If any constraint is satisfied

There is no feasible solution

Enumerate all solutions

Analize every combination

Project Selection

Energy Distribution

Investment Analysis

Knapsack Problem

Multiple Traveling Salesman Problem

Plant Building

Covers a wide range of Application Problems

Problems may have prompt solutions

IBM Cplex

Lingo

WinQSB

Gurobi

Implicit Enumeration

Branch and Bound

Exponential complexity

May create pointless branches

Creates a considerable quantity of subproblems