Duality in inexact fractional programming with set-inclusive constraints (Q1065723): Difference between revisions

This paper extends the fractional programming problem with set-inclusive constraints studied earlier by replacing every coefficient vector in the objective function with a convex set. A dual is formulated, and well- known duality results are established. A numerical example illustrates the dual strategy to obtain the value of the initial problem.