Abstract
This paper uses one variant of Karmarkar’s interior point linear programming algorithm and modifies it for addressing multiple objective linear programming (MOLP) problems. Specifically, the paper considers the modification of the affine-scaling primal algorithm and develops a procedure for generating search directions that are interior to the polytope formed by the constraints of the linear programming problem. These search directions are combined into a single direction that approximates the gradient of an implicitly-known utility function at the current — interior — solution point. The solution process is comprised of a sequence of steps where search direction are generated and later combined to arrive at the next interior iterate.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
