A. Mond, Richard R. Egudo
Abstract
Recently, Gulati and Craven gave a strict converse duality theorem for some of the Mond-Weir duals for non-linear programming problems. Here, we show that strict converse duality holds with weaker convexity conditions.
OpenAlex reports 7 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.
Recently, Gulati and Craven gave a strict converse duality theorem for some of the Mond-Weir duals for non-linear programming problems. Here, we show that strict converse duality holds with weaker convexity conditions.
Key concepts: Converse, Dual polyhedron, Wolfe duality, Duality (order theory), Weak duality, Strong duality, Duality gap, Convexity