Multiobjective programming with semilocally convex functions
Multiobjective programming, in recent times, has become an important area of investigation. We try to show naturally some of the uses of the class of semilocally convex functions in dealing with optimality conditions and duality theory as applied for treating a multiobjective mathematical program. The concept of semilocal convexity was introduced by G. M. Ewing (1977) who applied it to derive sufficient optimality conditions for variational and control problems. Semilocally convex functions have certain important convex type properties, e.g., local minima of semilocally convex functions defined on locally star-shaped sets are also global minima, and nonnegative linear combinations of semilocally convex functions are also semilocally convex. In Section 2 we introduce certain notations and mention the key lemmas which were relevant for single objective programming problems [see \textit{T. Weir}, ibid. 168, 1-12 (1992; Zbl 0762.90064)]. In the same section, some lemmas are given as statements in a different format. Finally, we state the alternative theorem derived by Weir which is an important proposition for deducing necessary optimality conditions. In Section 3 we introduce a multiobjective programming problem and we derive necessary saddle-point criteria for optimality for a semilocally convex program. Section 4 deals with Kuhn-Tucker necessary optimality conditions, sufficient optimality conditions, and duality for a semilocally convex multiobjective program. Some applications have been given in Section 5 for a multiobjective program with fractional objectives.
- Optimality with semilocally convex for multiobjective semi-infinite programming
- Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
- Duality in multiobjective nonlinear programming involving semilocally convex and related functions
- Optimality and duality on fractional multi-objective programming under semilocal E-convexity
- Optimality and duality in multiobjective programming involving higher order semilocally strong convexity
- Programming with semilocally quasiconvex functions
- Programming with semilocally convex functions
- Optimality conditions for Pareto nonsmooth nonconvex programming in Banach spaces
- Starshaped sets
- An \({\mathcal{UV}}\)-algorithm for semi-infinite multiobjective programming
- Multiple objective fractional programming involving semilocally type I-preinvex and related functions
- Optimality and duality in multiobjective fractional programming involving \(\rho\)-semilocally type I-preinvex and related functions
- Perturbing convex multiobjecttve programs
- Semilocally convex programming in ordered vector spaces
- scientific article; zbMATH DE number 5003796 (Why is no real title available?)
- Optimality with semilocally convex for multiobjective semi-infinite programming
- Semilocal E-preinvexity and its applications in nonlinear multiple objective fractional programming
- A fifth bibliography of fractional programming*
- Optimality conditions and duality in fractional programming involving semilocally preinvex and related functions
- Multiobjective programming under generalized type I invexity
- A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions
This page was built for publication: Multiobjective programming with semilocally convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916832)
