Results 31 to 40 of about 516 (82)
SOME RESULTS OF DUALITY IN FUZZY LINEAR PROGRAMMING
In this paper, based on linear ranking functions we investigate some properties for the fuzzy number linear programming problems and its dual with the relationships between them.
S. Hosaeni, J. Cheshmavar
semanticscholar +1 more source
Exact duality in semidefinite programming based on elementary reformulations [PDF]
In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP by an elementary approach: we reformulate any semidefinite system of the ...
Liu, Minghui, Pataki, Gabor
core +3 more sources
Minimax expected measure confidence sets for restricted location parameters
Running Title: Minimax measure confidence sets. AMS Subject Classifications: 62C10, 62C20, 62F25, 62F30, 90C46.
S. Evans, B. Hansen, P. Stark
semanticscholar +1 more source
In this paper, we establish sufficient optimality conditions for the (weak) efficiency to multiobjective fractional programming problems involving generalized (F,α,ρ,d)-V-type I functions. Using the optimality conditions, we also investigate a parametric-
Shun-Chin Ho
semanticscholar +2 more sources
A delimitation of the support of optimal designs for Kiefer's $\phi_p$-class of criteria [PDF]
The paper extends the result of Harman and Pronzato [Stat. & Prob. Lett., 77:90--94, 2007], which corresponds to $p=0$, to all strictly concave criteria in Kiefer's $\phi_p$-class.
Pronzato, Luc
core +3 more sources
WOLFE TYPE HIGHER ORDER SYMMETRIC DUALITY UNDER INVEXITY
KHUSHBOO VERMA AND T. R. GULATIAbstract. In this paper, we introduce a pair of higher-order symmetricdual models/problems. Weak, strong and converse duality theorems forthis pair are established under the assumption of higher-order invexity.Moreover ...
Khushboo Verma, T. R. Gulati
semanticscholar +1 more source
The main purpose of this paper is to study a pair of optimization problems on differentiable manifolds under (p, r)-invexity assumptions. By using the (p, r)-invexity assumptions on the functions involved, optimality conditions and duality results (Mond ...
S. Jana, C. Nahak
semanticscholar +1 more source
Nonconvex composite multiobjective nonsmooth fractional programming
We consider nonsmooth multiobjective programs where the objective function is a fractional composition of invex functions and locally Lipschitz and Gâteaux differentiable functions.
Ho Jung Kim, Do Sang Kim
semanticscholar +2 more sources
On the Duality of Semiantichains and Unichain Coverings [PDF]
We study a min-max relation conjectured by Saks and West: For any two posets $P$ and $Q$ the size of a maximum semiantichain and the size of a minimum unichain covering in the product $P\times Q$ are equal. For positive we state conditions on $P$ and $Q$
Bart Lomiej Bosek+4 more
core
On generalized Fenchel-Moreau theorem and second-order characterization for convex vector functions
Based on the concept of conjugate and biconjugate maps introduced in (Tan and Tinh in Acta Math. Viet. 25:315-345, 2000) we establish a full generalization of the Fenchel-Moreau theorem for the vector case.
Phan Nhat Tinh, Do Sang Kim
semanticscholar +2 more sources