An interactive interior point algorithm for multiobjective linear programming problems

Authors:
B. Aghezzaf;T. Ouaderhman
Affiliations:
Département de Mathématiques et d'Informatique, Faculté des Sciences Ain chock, B.P. 5366 Marif, Casablanca, Morocco;Département de Mathématiques et d'Informatique, Faculté des Sciences Ain chock, B.P. 5366 Marif, Casablanca, Morocco
Venue:
Operations Research Letters
Year:
2001

Citing 4
Cited 2

A convergent interactive cutting-plane algorithm for multiobjective optimization

Operations Research
An algorithm for linear programming which requires O((m+n)n2 + (m+n)1.5n)L) arithmetic operations

Mathematical Programming: Series A and B
An interactive method for multiple-objective mathematical programming problems

Journal of Optimization Theory and Applications
Path-following methods for linear programming

SIAM Review

A novel LMI based swing-up robust controller for a serial double inverted pendulum

ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Hybrid chaos optimization and affine scaling search algorithm for solving linear programming problems

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an interactive interior point method for finding the best compromise solution to a multiple objective linear programming problem. We construct a sequence X^0,X"1,...,X^k,... of smaller and smaller polytopes which shrink towards the compromise solution. During the kth iteration, we move from the center of polytope X^k^-^1 to the center of polytope X^k by performing a local optimization which consists of maximizing a linear function over an ellipsoid.