Abstract
We present a new interactive multiobjective linear programming algorithm that is based on one variant of Karmarkar's algorithm known as the path-following primal-dual algorithm. The modification of this single-objective linear programming algorithm to the multiobjective case is done by deriving an approximate gradient to the implicitly-known utility function. By interacting with the decision maker, locally-relevant preference information are elicited and the approximated gradient can therefore be continuously updated. The interior step direction is then generated by projecting the approximate gradient and taking an interior step from the current iterate to the new one along this projection.
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.
