Abstract
In this paper, new iterative method is proposed based on parametrization for solving Integer Linear Programming (ILP) problems with four variables and an algorithm is provided. Our method, which is better than the cutting plane method and branch and bound methods in solving ILP problems with four variables, can be easily applied regardless of the number of constraints. In addition, in our method, all alternative solutions are found and presented to the decision maker. A numerical example is solved by applying the proposed method.
Keywords
Integer programming
Cutting-plane method
Linear programming
Mathematical optimization
Branch and price
Integer (computer science)
Branch and cut
Mathematics
Algorithm
Parametrization (atmospheric modeling)
Branch and bound
Computer science
Subject Areas
Vehicle Routing Optimization Methods
·Industrial and Manufacturing Engineering ·Physical Sciences
Optimization and Packing Problems
·Industrial and Manufacturing Engineering ·Physical Sciences
Advanced Optimization Algorithms Research
·Numerical Analysis ·Physical Sciences
OpenAlex SDG Match
SDGs auto-classified by OpenAlex (score ≥ 0.4 shown).
Peace, Justice and strong institutions 79%
Loading…