Results 1 to 10 of about 3,773 (119)

Strong complementary approximate Karush-Kuhn-Tucker conditions for multiobjective optimization problems [PDF]

open access: yesYugoslav Journal of Operations Research, 2022
In this paper, we establish strong complementary approximate Karush- Kuhn-Tucker (SCAKKT) sequential optimality conditions for multiobjective optimization problems with equality and inequality constraints without any constraint qualifications and ...
Maurya Jitendra Kumar   +1 more
doaj   +1 more source

Generalized invexity and mathematical programs [PDF]

open access: yesYugoslav Journal of Operations Research, 2021
In this paper, using generalized convexity assumptions, we show that Mstationary condition is sufficient for global or local optimality under some mathematical programming problem with equilibrium constraints(MPEC).
Joshi Bhuwan Chandra   +2 more
doaj   +1 more source

Optimality conditions and duality for multiobjective semi-infinite programming with data uncertainty via Mordukhovich subdifferential [PDF]

open access: yesYugoslav Journal of Operations Research, 2021
Based on the notation of Mordukhovich subdifferential in [27], we propose some of new concepts of convexity to establish optimality conditions for quasi ε−solutions for nonlinear semi-infinite optimization problems with data uncertainty in constraints ...
Pham Thanh-Hung
doaj   +1 more source

A Note on the McCormick Second-Order Constraint Qualification

open access: yesTrends in Computational and Applied Mathematics, 2022
The study of optimality conditions and constraint qualification is a key topic in nonlinear optimization. In this work, we present a reformulation of the well-known second-order constraint qualification described by McCormick in [17]. This reformulation
M. D. Sánchez   +2 more
doaj   +1 more source

A New Weak Slater Constraint Qualification for Non-Smooth Multi-Objective Semi-Infinite Programming Problems [PDF]

open access: yesControl and Optimization in Applied Mathematics, 2023
This paper addresses a non-smooth multi-objective semi-infinite programming problem that involves a feasible set defined by inequality constraints. Our focus is on introducing a new weak Slater constraint qualification and deriving the necessary and ...
Hamed Soroush
doaj   +1 more source

Guignard Qualifications and Stationary Conditions for Mathematical Programming with Nonsmooth Switching Constraints [PDF]

open access: yesControl and Optimization in Applied Mathematics, 2021
In this paper, some constraint qualifications of the Guignard type are defined for optimization problems with continuously differentiable objective functions and locally Lipschitz switching constraints.
Fatemeh Gorgini Shabankareh   +3 more
doaj   +1 more source

On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints [PDF]

open access: yesYugoslav Journal of Operations Research, 2019
In this paper, we considered the mathematical programs with vanishing constraints or MPVC. We proved that an MPVC-tailored penalty function, introduced in [5], is still exact under a very weak and new constraint qualification.
Nath Triloki, Khare Abeka
doaj   +1 more source

Optimality Conditions for Multiobjective Mathematical Programming Problems with Equilibrium Constraints on Hadamard Manifolds

open access: yesMathematics, 2022
In this paper, we consider a class of multiobjective mathematical programming problems with equilibrium constraints on Hadamard manifolds (in short, (MMPEC)).
Savin Treanţă   +3 more
doaj   +1 more source

A Comparison of Normal Cone Conditions for Homotopy Methods for Solving Inequality Constrained Nonlinear Programming Problems

open access: yesAdvances in Mathematical Physics, 2020
Homotopy methods are powerful tools for solving nonlinear programming. Their global convergence can be generally established under conditions of the nonemptiness and boundness of the interior of the feasible set, the Positive Linear Independent ...
Zhengyong Zhou, Ting Zhang
doaj   +1 more source

Necessary Optimality Conditions for Non-smooth Continuous-Time Problems Using Convexificators [PDF]

open access: yesControl and Optimization in Applied Mathematics, 2020
In this paper, we develop general necessary optimality conditions of the KKT types for non-smooth continuous-time optimization problems with inequality constraints. The primary instrument in our study is the concept of a convexificator.
Ali Ansari Ardali
doaj   +1 more source

Home - About - Disclaimer - Privacy