S. Chandra, B. D. Craven, B. Mond
Abstract
Duality and converse duality are studied for a class of multiobjective fractional programming problems, where properly efficient solutions are required. These are related to vector saddle points of a suitable vector valued Lagrangian.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Duality and converse duality are studied for a class of multiobjective fractional programming problems, where properly efficient solutions are required. These are related to vector saddle points of a suitable vector valued Lagrangian.
Key concepts: Mathematics, Fractional programming, Duality (order theory), Converse, Strong duality, Lagrangian, Multiobjective programming, Class (philosophy)