Constrained integer multiobjective linear fractional programming problem

Constrained integer multiobjective linear fractional programming problem

0.00 Avg rating0 Votes
Article ID: iaor19972107
Country: South Korea
Volume: 21
Issue: 3
Start Page Number: 227
End Page Number: 238
Publication Date: Dec 1996
Journal: Journal of the Korean ORMS Society
Authors: ,
Keywords: programming: fractional
Abstract:

In this paper an algorithm based on cutting plane approach is developed which constructs all the efficient p-tuples of multiobjective integer linear fractional programming problem. The integer solution is constrained to satisfy any h out of n additional constraint sets. A numerical illustration in support of the proposed algorithm is developed.

Reviews

Required fields are marked *. Your email address will not be published.