The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized (F, b, φ, ρ, θ)univexity assumptions for a continuous minmax fractional programming problem involving arbitrary norms.

This paper presents a voltage stability constrained optimal power flow that is expressed via a bilevel programming framework. The inner objective function is dedicated for maximizing voltage stability margin while the outer objective function is focused on minimization of total production cost of thermal units. The original two stage problem is converted to a single level optimization problem v...

in this paper, using clarke’s generalized directional derivative and di-invexity we introduce new concepts of nonsmooth k-α-di-invex and generalized type i univex functions over cones for a nonsmooth vector optimization problem with cone constraints. we obtain some sufficient optimality conditions and mond-weir type duality results under the foresaid generalized invexity and type i cone-univexi...

Abstract Greedy algorithms are among the most elementary ones in theoretical computer science and understanding conditions under which they yield an optimum solution is a widely studied problem. Greedoids were introduced by Korte Lovász at beginning of 1980s as generalization matroids. One basic motivations notion was to extend background behind greedy beyond well-known results on Indeed, many ...