A Heuristic Approach for Solving LIP with the Optional Feasible or Infeasible Initial Solution Points

An interactive heuristic approach can offer a practical solution to the problem of linear integer programming (lip) by combining an optimization technique with the decision maker’s (dm) judgment and technical supervision. this is made possible using the concept of bicriterion linear programming (blp) problem in an integer environment. this model proposes two bicriterion linear programs for identifying a feasible solution point when an initial infeasible solution point is provided by the decision maker or when the searching process leaves the region of feasibility seeking for a better pattern to improve the objective function. instructions regarding the structure of such blp problems are broadly discussed. this added property offers a great degree of flexibility to the decision making problem solving process. the heuristic engine is comprised of four algorithms: improve, feasible, leave, and backtrack. in each iteration, when a selected algorithm has been terminated, the dm is presented with the results and asked to reevaluate the solution process by choosing an appropriate algorithm to follow. it is shown that the method converges to the optimal solution for most of the time. a solution technique for solving such a problem is introduced with sufficient details.