A note on programming problems with linear-plus-linear-fractional objective functions

A note on programming problems with linear-plus-linear-fractional objective functions

0.00 Avg rating0 Votes
Article ID: iaor19982418
Country: Netherlands
Volume: 89
Issue: 1
Start Page Number: 212
End Page Number: 214
Publication Date: Feb 1996
Journal: European Journal of Operational Research
Authors:
Keywords: duality
Abstract:

In a recent paper Chadha presented a dual of a maximization problem for the sum of a linear and linear fractional function under linear constraints. His approach is based on assertions of Teterev which have been already proven to be erroneous. The aim of this note is to clarify deficiencies of the proposed duality and to illustrate facts about the behaviour of the objective function by an example.

Reviews

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