Displaying 21 – 40 of 108

Showing per page

Dualidad de Haar y problemas de momentos.

Miguel Angel Goberna Torrent (1986)

Trabajos de Investigación Operativa

En la primera parte de este trabajo damos una versión simplificada de la conocida relación entre la dualidad en Programación Semi-Infinita y cierta clase de problemas de momentos, basándonos en las propiedades de los sistemas de Farkas-Minkowski. Planteamos a continuación otra clase de problemas de momentos para cuyo análisis resulta de utilidad una generalización del Lema de Farkas.

Duality for a fractional variational formulation using η -approximated method

Sony Khatri, Ashish Kumar Prasad (2023)

Kybernetika

The present article explores the way η -approximated method is applied to substantiate duality results for the fractional variational problems under invexity. η -approximated dual pair is engineered and a careful study of the original dual pair has been done to establish the duality results for original problems. Moreover, an appropriate example is constructed based on which we can validate the established dual statements. The paper includes several recent results as special cases.

Exact l 1 penalty function for nonsmooth multiobjective interval-valued problems

Julie Khatri, Ashish Kumar Prasad (2024)

Kybernetika

Our objective in this article is to explore the idea of an unconstrained problem using the exact l 1 penalty function for the nonsmooth multiobjective interval-valued problem (MIVP) having inequality and equality constraints. First of all, we figure out the KKT-type optimality conditions for the problem (MIVP). Next, we establish the equivalence between the set of weak LU-efficient solutions to the problem (MIVP) and the penalized problem (MIVP ρ ) with the exact l 1 penalty function. The utility of...

First-Order Conditions for Optimization Problems with Quasiconvex Inequality Constraints

Ginchev, Ivan, Ivanov, Vsevolod I. (2008)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 90C46, 90C26, 26B25, 49J52.The constrained optimization problem min f(x), gj(x) ≤ 0 (j = 1,…p) is considered, where f : X → R and gj : X → R are nonsmooth functions with domain X ⊂ Rn. First-order necessary and first-order sufficient optimality conditions are obtained when gj are quasiconvex functions. Two are the main features of the paper: to treat nonsmooth problems it makes use of Dini derivatives; to obtain more sensitive conditions, it admits directionally...

Currently displaying 21 – 40 of 108