Convexity assumptions for fractional programming of variational type are relaxed to generalized invexity. The sufficient optimality conditions are employed to construct a mixed dual programming problem. It will involve the Wolfe type dual and Mond-Weir type dual as its special situations. Several duality theorems concerning weak, strong, and strict converse duality under the framework in mixed ...

The aluminum cold spray feedstock powder was single- and dual-reinforced with no greater than 2 vol% boron nitride nanoplatelets (BNNP) and/or nanometric carbide (nB4C). These powders were sprayed onto Al-6061 substrates then heat-treated in an argon environment. In addition, micro- nano-indentation hardness wear testing performed on the samples. Further microscopy optical profilometry used to ...

We give a complete solution to an open problem of Thomas Cover in 1987 about the capacity relay channel general discrete memoryless setting without any additional assumptions. The key step our approach is lower bound certain soft-max stochastic process by convex geometry methods, which based on two ideas: First, bounded terms supremum another process, approximating set with polytope number vert...

The striking analogy between mixed volumes of convex bodies and mixed discriminants of positive semidefinite matrices has repeatedly been observed. It was A. D. Aleksandrov [1] who, in his second proof of the Aleksandrov–Fenchel inequalities for the mixed volumes, first introduced the mixed discriminants of positive semidefinite quadratic forms and established some of their properties, includin...