Nguyen Thi Hong Linh, Jean‐Paul Penot
Abstract
We present necessary and sufficient optimality conditions for a problem with a convex set constraint and a quasiconvex objective function. We apply the obtained results to a mathematical programming problem involving quasiconvex functions.
OpenAlex reports 26 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.
We present necessary and sufficient optimality conditions for a problem with a convex set constraint and a quasiconvex objective function. We apply the obtained results to a mathematical programming problem involving quasiconvex functions.
Key concepts: Quasiconvex function, Mathematics, Mathematical optimization, Constraint (computer-aided design), Regular polygon, Pseudoconvex function, Convex optimization, Function (biology)