An Efficient Method of Solving Lexicographic Linear Goal Programming Problem



Lexicographic Linear Goal programming within a pre-emptive priority structure has been one of the most widely used techniques considered in solving multiple objective problems. In the past several years, the modified simplex algorithm has been shown to be widely used and very accurate in computational formulation. Orumie and Ebong recently developed a generalized linear goal programming algorithm that is efficient. A new approach for solving lexicographic linear Goal programming problem is developed, together with an illustrative example. The method is efficient in reaching solution.

Keywords: Lexicographic Goal programming, multi objective, simplex method.

Full Text: PDF
Download the IISTE publication guideline!

To list your conference here. Please contact the administrator of this platform.

Paper submission email:

ISSN (Paper)2224-3186 ISSN (Online)2225-0921

Please add our address "" into your email contact list.

This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.

Copyright ©