Solving Multi Objective Linear Programming Problems Using Vague Optimization Method: A Comparative Study

Abstract

This newspaper's goal is to current a computational procedure for resolving a multi-objective lined programming problematic by means of a unclear optimization technique. It also covers some significant possessions of a unclear set, as healthy as processes on it. The procedure's growth is based on the finest choice set code, which is got by journey dissimilar vague choice sets obtained for apiece objective drive. Also, because the indistinct optimization method employs degrees of fit in and non- fitting, we done a relative schoolwork of line and nonlinear hint functions for fitting and non-belonging to realize how they touch optimization and gain understanding into such a process. To demonstrate the advanced procedure, a numerical instance has stood provided.