Comparison between Goal Programming and other Linear Programming Methods

Abstract

Linear Programming (LP) widely used mathematical technique designed to help operation manager's plan and make the decision necessary to allocate resources. It is often desirable to find production level that will produce maximum profit and minimum cost. The production process can be described with a set of linear inequalities which is called as Constraints. The profit and cost function to be maximize or minimize is called as Objective Function. The process of finding optimal level with the set of linear inequalities is called as Linear Programming. In manufacturing problem LP problem determines the number of units of different products which should be produced and sold by firm when each product requires fixed manpower, machine hour, labour hour per unit of product, warehouse space per unit of output etc. in order to make maximum profit. The scope of current study is to determine appropriate method among various LP problems by comparing any LP problem and Goal Programming (GP) problem.