Results 61 to 70 of about 1,995,695 (219)
On constraint qualifications with generalized convexity and optimality conditions [PDF]
This paper deals with a multiobjective programming problem involving both equality constraints in infinite dimensional spaces. It is shown that some constraint qualifications together with a condition of interior points are sufficient conditions for the ...
Do Van Luu, Manh-Hung Nguyen
core
Inexact restoration approaches to solve mathematical program with complementarity constraints [PDF]
, 2012 Mathematical Program with Complementarity Constraints (MPCC) finds application in many fields. As the complementarity constraints fail the standard Linear Independence Constraint Qualification (LICQ) or the Mangasarian-Fromovitz constraint qualification (
Matias, João +2 more
core
MathematicsIn this paper, we investigate constraint qualifications and optimality conditions for multiobjective mathematical programming problems with vanishing constraints (MOMPVC) on Hadamard manifolds.
Balendu Bhooshan Upadhyay +3 more
doaj +1 more source
A globally convergent algorithm for MPCC
EURO Journal on Computational Optimization, 2015 We propose a penalty formulation based on the new regularization scheme for mathematical programs with complementarity constraints (MPCCs). We present an active set method which solves a sequence of penalty-regularized problems.
Abdeslam Kadrani +2 more
doaj +1 more source
Characterization of the optimal plans for the Monge-Kantorovich transport problem
, 2006 We present a general method, based on conjugate duality, for solving a convex minimization problem without assuming unnecessary topological restrictions on the constraint set.
Léonard, Christian
core +2 more sources
Constraint Qualifications and Optimality Conditions in Bilevel Optimization [PDF]
, 2020 In this paper we study constraint qualifications and optimality conditions for bilevel programming problems. We strive to derive checkable constraint qualifications in terms of problem data and applicable optimality conditions. For the bilevel program with convex lower level program we discuss drawbacks of reformulating a bilevel programming problem by
openaire +2 more sources
A Sequential Homotopy Method for Mathematical Programming Problems
, 2019 We propose a sequential homotopy method for the solution of mathematical programming problems formulated in abstract Hilbert spaces under the Guignard constraint qualification.
Bock, Hans Georg, Potschka, Andreas
core
AxiomsNonsmooth multiobjective mathematical programming problems with equilibrium constraints (NMMPEC) are studied in this article in the Hadamard manifold setting.
B. B. Upadhyay +3 more
doaj +1 more source
AxiomsThis article deals with mathematical programs with vanishing constraints (MPVCs) involving lower semi-continuous functions. We introduce generalized Abadie constraint qualification (ACQ) and MPVC-ACQ in terms of directional convexificators and derive ...
Ram Narayan Mohapatra +2 more
doaj +1 more source
On the uniqueness of the optimal solution in linear programming
Journal of Numerical Analysis and Approximation Theory, 2006 In this paper numerous necessary and sufficient conditions will be given for a vector to be the unique optimal solution of the primal problem, as well as for that of the dual problem, and even for the case when the primal and the dual problem have unique
Peter Szilágyi
doaj +2 more sources