critic
发表于 2025-3-25 05:28:56
http://reply.papertrans.cn/39/3822/382193/382193_21.png
Jacket
发表于 2025-3-25 10:07:49
http://reply.papertrans.cn/39/3822/382193/382193_22.png
Hemiparesis
发表于 2025-3-25 15:22:23
Characterizing Invex and Related PropertiesA characterization of ., given by Glover and Craven, is extended to functions in abstract spaces. . for a vector function coincides with . in a restricted set of directions. The . property of Jeyakumar and Mond is also characterized. Some differentiability properties of the invex . are also obtained.
depreciate
发表于 2025-3-25 18:46:16
Second Order Optimality Conditions for Nonsmooth Multiobjective Optimization ProblemsIn this paper second-order necessary optimality conditions for nonsmooth vector optimization problems are given by smooth approximations. We extend to the vector case the approach introduced by Ermoliev, Norkin and Wets to define generalized derivatives for discontinuous functions as limit of the classical derivatives of regular functions.
infantile
发表于 2025-3-25 21:50:13
http://reply.papertrans.cn/39/3822/382193/382193_25.png
撕裂皮肉
发表于 2025-3-26 00:27:55
A Plastics Overview: Figures and Tablesussed, the idea of polyhedral combinatorics is outlined and the use of convexity concepts in algorithmic design is shown. Moreover, combinatorial optimization problems arising from convex configurations in the plane are discussed.
nugatory
发表于 2025-3-26 04:55:45
Hillard M. Lazarus,Alvin H. Schmaierproblems we state weak and strong duality theorems based on different generalized concavity assumptions. The proposed dual problems provide a unified framework generalizing Wolfe and Mond-Weir results.
Conclave
发表于 2025-3-26 12:17:03
Standard Operating Procedures (SOP),is transformation preserves pseudoconvexity of a function. The result is then used to characterize sums of two linear fractional functions which are still pseudoconvex. This in turn leads to a characterization of pseudolinear sums of two linear fractional functions.
WAX
发表于 2025-3-26 15:17:11
http://reply.papertrans.cn/39/3822/382193/382193_29.png
暴发户
发表于 2025-3-26 17:42:51
(Generalized) Convexity and Discrete Optimizationussed, the idea of polyhedral combinatorics is outlined and the use of convexity concepts in algorithmic design is shown. Moreover, combinatorial optimization problems arising from convex configurations in the plane are discussed.