5 2 Mixed Integer Linear Programming 5 2
- Slides: 32
5. 2 Mixed Integer Linear Programming 5. 2. 2 Implicit Enumeration
Assignment Problem
Assignment Problem [Theorem] Any basic feasible solution of the assignment problem has every xij equal to either zero or one. Implication: There at most n variables that have the value 1.
Basic Concept The basic idea of implicit enumeration is to explicitly enumerate a small subset of all possible solutions while concluding that it is not necessary to explicitly investigate the remaining solutions, because they are either infeasible or will result in an objective value that is inferior to the best integer solution already found.
Search Rules • A forward step is defined as the branching process of fixing a free variable to be 1. • The backtracking step is defined as the process to trace back to the origin until encounter the 1 st node with only one descending branch. • The search process is continued until all pendant nodes are fathomed and each non-pendant node has exactly 2 branches.
Additional Terminologies • Completion: Given a node and a partial solution, a completion of the partial solution is a solution in which values are specified for all the remaining free variables. • Fathom: A partial solution is fathomed by either (1) demonstrating that there are no improving feasible completions or (2) finding the best feasible solution.
Standard Form
Zero Completion Test
Infeasibility Test If no feasible completions (may or may not be zero completion), then the node should be fathomed.
Example
Subproblem P 0 All variables are free.
Subproblem P 1 (x 1=1) 0 1
Subproblem P 1 (x 1=1)
Subproblem P 2 (x 1=1, x 2=1)
Subproblem P 3 (x 1=1, x 2=0)
4
Subproblem P 4 (x 1=1, x 2=0, x 3=1)
Subproblem P 5 (x 1=1, x 2=0, x 3=0)
Subproblem P 6 (x 1=0)
Subproblem P 7 (x 1=0, x 2=1)
Subproblem P 8 (x 1=0, x 2=0)
Solution • The optimal integer solution is given by the incumbent solution found at node 7. • Note that the complete tree would have 5 levels and 2^5=32 pendant nodes.
Blending Products including Batch Sizes In a plant we have 2 production units designated as number 1 and 2, making product 1 and 2, respectively, from the 3 feedstocks as shown. Unit 1 has a maximum capacity of 8000 lb/day, and unit 2 of 10000 lb/day. To make 1 lb of product 1 requires 0. 4 lb of A and 0. 6 lb of B; to make 1 lb of product 2 requires 0. 3 lb of B and 0. 7 lb of C. A maximum 6000 lb/day of B is available, but there are no limits on the available amounts of A and C. Assume the net revenue after expenses from the manufacture of product 1 id $0. 16/lb, and of product 2 is $0. 20/lb. How much of products 1 and 2 should be produced per day, assuming that each must be made in batches of 2000 lb?
- Mixed integer linear programming
- Mixed integer linear programming
- Mixed integer linear programming
- Mixed integer linear programming
- What is integers
- Perbedaan linear programming dan integer programming
- Integer programming vs linear programming
- Definisi integer
- Deep neural networks and mixed integer linear optimization
- Linear vs integer programming
- Linear integer programming
- Integer programming course
- Integer programming problem
- Fixed charge problem integer programming
- Integer programming mit
- Integer programming example
- Gomorys
- Application of integer programming
- Greedy programming vs dynamic programming
- What is system programming
- Linear programming
- Shortest path linear programming
- Canonical form lp
- Linear programming case study examples
- Non negativity constraints
- Scope of linear programming
- Network model linear programming
- Linear programming management science
- Linear management
- Linear programming word problems
- Characteristics of
- An animal feed company must produce 200 kg of a mixture
- Definisi linear programming