20,179 research outputs found
Duality in Fractional Programming Involving Locally Arcwise Connected and Related Functions
A nonlinear fractional programming problem is considered, where the functions involved are diferentiable with respect to an arc.Necessary and su±cient optimality conditions are obtained in terms of the right diferentials with respect to an arc of the functions. A dual is formulated and duality results are proved using concepts of locally arcwise connected, locally Q-connected and locally P-connected functions .Our results generalize the results obtained by Lyall, Suneja and Aggarwal, Kaul and Lyall and Kaul et.al.Generalized convexity; Fractional programming; Optimality conditions, Duality
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
Mathematical programming is a branch of applied mathematics and has recently
been used to derive new decoding approaches, challenging established but often
heuristic algorithms based on iterative message passing. Concepts from
mathematical programming used in the context of decoding include linear,
integer, and nonlinear programming, network flows, notions of duality as well
as matroid and polyhedral theory. This survey article reviews and categorizes
decoding methods based on mathematical programming approaches for binary linear
codes over binary-input memoryless symmetric channels.Comment: 17 pages, submitted to the IEEE Transactions on Information Theory.
Published July 201
Duality and randomization in nonlinear programming
We consider the NLP optimization problem
??
and discuss the duality gap between P and
??
The convex problem D is in fact the dual of a ``relaxed'' version of P via ``randomization'' which permits to give a simple interpretation for the presence or absence of a duality gap in the general case. Several particular cases are also discussed and the case of homogeneous functions is given special attention
Generalized Second-Order Duality for a Continuous Programming Problem with Support Functions
A generalized second-order dual is formulated for a continuous programming problem in which support functions appear in both objective and constraint functions, hence it is nondifferentiable. Under second-order pseudoinvexity and second-order quasi-invexity, various duality theorems are proved for this pair of dual continuous programming problems. Special cases are deduced and a pair of dual continuous programming problems with natural boundary values is constructed and it is pointed out that the duality results for the pair can be validated analogously to those of the dual models with fixed end points. Finally, a close relationship between duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly mentioned
Extended Duality in Fuzzy Optimization Problems
Duality theorem is an attractive approach for solving fuzzy optimization problems. However, the duality gap is generally nonzero for nonconvex problems. So far, most of the studies focus on continuous variables in fuzzy optimization problems. And, in real problems and models, fuzzy optimization problems also involve discrete and mixed variables. To address the above problems, we improve the extended duality theory by adding fuzzy objective functions. In this paper, we first define continuous fuzzy nonlinear programming problems, discrete fuzzy nonlinear programming problems, and mixed fuzzy nonlinear programming problems and then provide the extended dual problems, respectively. Finally we prove the weak and strong extended duality theorems, and the results show no duality gap between the original problem and extended dual problem
Second-order symmetric duality with cone constraints
AbstractWolfe and Mond–Weir type second-order symmetric duals are formulated and appropriate duality theorems are established under η-bonvexity/η-pseudobonvexity assumptions. This formulation removes several omissions in an earlier second-order primal dual pair introduced by Devi [Symmetric duality for nonlinear programming problems involving η-bonvex functions, European J. Oper. Res. 104 (1998) 615–621]
- …