Group presentations Operations and research
BECO 2.2
Bachelor of science in economics
Group 1
Group members details
1. Collins Isavi B009/404356/2024
2. Vincent Mutia B009/404372/2024
3. Reinhard Marsha B009/404362/2024
4. Lawrence Kamau B009/404361/2024
5. Michael Okinyi B009/404386/2024
6. Tracy Achieng B009/404338/2024
7. Kariuki Ivy B009/404384/2024
8. Movin Atieno B009/403796/2024
9. Henry Njihia B009/404340/2024
INTEGER PROGRAMMING (IP)
1. Definition of Integer Programming
Integer Programming (IP) is a type of Linear Programming where some or all decision
variables are restricted to take only whole number (integer) values.
This is important because in real-life situations, fractional values are often impractical (e.g.,
you cannot have 2.5 workers or 3.7 machines).
2. Types of Integer Programming
(a) Pure Integer Programming: All decision variables must be integers.
(b) Mixed Integer Programming (MIP): Some variables are integers while others can take
continuous values.
(c) Binary (0–1) Integer Programming: Variables can only take values of 0 or 1, used for
yes/no decisions.
3. General Form
Maximize or Minimize: Z = c1x1 + c2x2 + ... + cnxn
Subject to constraints: a11x1 + a12x2 + ... + a1nxn ≤ b1, etc.
All decision variables must satisfy non-negativity and integer conditions.
4. Difference Between LP and IP
Linear Programming allows fractional solutions, while Integer Programming requires whole
numbers.
IP problems are more complex and require specialized solution methods.
5. Methods of Solving Integer Programming
(a) Graphical Method: Used for two variables. Solve as LP then check integer points.
(b) Branch and Bound Method: Solve LP relaxation, then divide into subproblems and
eliminate non-optimal solutions.
(c) Cutting Plane Method: Add constraints to remove fractional solutions until integer
solution is found.
6. LP Relaxation
This involves solving the problem without integer restrictions.
It provides a benchmark (upper or lower bound) for the optimal solution.
7. Feasible and Optimal Solutions
A feasible solution satisfies all constraints including integer conditions.
An infeasible solution violates constraints.
An optimal solution is the best feasible integer solution.
8. Advantages of Integer Programming
Provides realistic and practical solutions.
Useful in decision-making processes.
Applicable in various fields such as logistics and production.
9. Limitations of Integer Programming
Computationally complex and time-consuming.
Requires advanced techniques to solve large problems.
10. Applications
Production planning: determining number of units to produce.
Scheduling: assigning tasks or workers.
Capital budgeting: selecting projects.
Transportation: routing and allocation.
11. Example Problem
Maximize: Z = 5x + 3y
Subject to: 2x + y ≤ 7, x + y ≤ 5, x, y ≥ 0 and integers.
Solution involves solving LP, identifying feasible region, and checking integer points.