Feasible Region Contraction Interior-Point Algorithm (FERCIPA) Solver for Multi-Objective Linear Programming Problems


Authors : Edwin F. Nsien, Ubon A. Abasiekwere, Paul J. Udoh.

Volume/Issue : Volume 4 - 2019, Issue 3 - March

Google Scholar : https://goo.gl/DF9R4u

Scribd : https://bit.ly/2JYXOr2

This paper presents FERCIPA solver for linear programming problems. The solver which can handle both single objective and multi-objective linear programming problems of large scales generates a sequence of interior feasible points that converge at the optimal solution for single objective linear programming problems and an optimal compromise solution for multi-objective linear programming problems. The solver is validated by its application to handle single objective linear programming problems and multi-objective linear programming problems involving up to six bounded variables and functional constraints. The solution obtained by FERCIPA solver is seen to compare favourably with those of other software like the Feasible Region Contraction Algorithm (FRCA) and MATLAB.

Keywords : FERCIPA Solver, Multi-objective linear programming, Interior feasible point, Optimal compromise solution.

CALL FOR PAPERS


Paper Submission Last Date
31 - March - 2024

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Video Explanation for Published paper

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe