A Five Phase Procedure for Implementing a Vector-Maximum Algorithm for Multiple Objective Linear Programming Problems

摘要: Previously developed algorithms for the vector-maximum problem can be thought of in terms three phases. Phases I and II consist finding an initial feasible extreme point efficient point, respectively. Phase III involves all remaining points. When applying such to multiple objective linear programming problems, they have not been found very useful because large numbers points generated. In attempt reduce amount efficiency information presented decision-maker facilitate final selection process by which is choose his greatest utility, research this paper describes expanded five phase procedure. O first two additional express partial about preferences interval criterion weights. The effect limit portion surface region from are IV second It follows O, I, II, III. subjects subset produced a filtering technique order eliminate most redundant solutions. By proper manipulation, neighborhoods relatively evenly dispersed any reduced size obtained.