Computing an Optimal Solution for LAP through Hungarian Method- A New Approach
Main Article Content
Abstract
Assignment problems (AP) are well-known topics in engineering and management science and are used frequently to analyze problems. A linear programming problem form was used in transforming assignment problem for crisp problem and in solving as per Hungarian methodology. Assigning n objects over m objects is an exciting problem that arises in different situations. Here we explore the optimal ways for assigning in n objects over m other objects. Numerous numerical applications are needed in production planning, Sales proportions, airline operators, etc. The existing Hungarian methods and maximized (or minimized) assignment methods have been solved using these methods. Entry details in the cost matrix are not always clear. This parameter is uncertain in many applications, and these uncertain parameters are represented by intervals. To solve interval linear assignment problems, we present interval Hungarian method and interval analysis concept.