Search
Search Results
-
Lagrangian Duality in Convex Conic Programming with Simple Proofs
In this paper, we study Lagrangian duality aspects in convex conic programming over general convex cones. It is known that the duality in convex...
-
Incorporating convex risk measures into multistage stochastic programming algorithms
Over the last two decades, coherent risk measures have been well studied as a principled, axiomatic way to characterize the risk of a random...
-
Robust duality in multi-dimensional vector fractional variational control problem
This paper deals with the investigation of vector fractional variational control problem taking data uncertainty into account. Several kinds of dual...
-
Solving certain complementarity problems in power markets via convex programming
We address the solution of certain Mathematical Programs with Equilibrium Constraints (MPECs) in power markets using convex optimization. These MPECs...
-
Convex Optimization: Saddle Points Characterization and Introduction to Duality
In the last 50 years or more, the words “nonsmooth optimization” generally refer to nonlinear programming problems (or also to problems of calculus...
-
On directionally differentiable multiobjective programming problems with vanishing constraints
In this paper, a class of directionally differentiable multiobjective programming problems with inequality, equality and vanishing constraints is...
-
Symmetric Duality for a Multiobjective Fractional Programming with Cone Objectives as Well as Constraints
In the present article, we study naturally K-pseudoconvex and strongly K-pseudoconvex definition and also give existing numerical examples of...
-
Optimality analysis and duality conditions for a class of conic semi-infinite program having vanishing constraints
This work focuses on a non-smooth conic semi-infinite programming problem having vanishing constraints. Using the limiting constraint qualification,...
-
Linear Programming and Quadratic Programming
As said in the previous pages, a Linear Programming problem (L. P. for friends)Problemlinear programming is characterized by a linear (or a linear...
-
Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints
In this paper, the class of differentiable semi-infinite multiobjective programming problems with vanishing constraints is considered. Both...
-
Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints
In this paper, we establish some quotient calculus rules in terms of contingent derivatives for the two extended-real-valued functions defined on a...
-
Duality Theorems for Convex and Quasiconvex Set Functions
In mathematical programming, duality theorems play a central role. Especially, in convex and quasiconvex programming, Lagrange duality and surrogate...
-
Correspondence between a new class of generalized cone convexity and higher order duality
In this paper, a new class of generalized higher order cone convex functions is first introduced. A fractional nondifferentiable vector optimization...
-
New Class of Multiobjective Fractional Symmetric Programming with Cone Functions Under Generalized Assumptions
In this chapter, a pair of nondifferentiable multiobjective symmetric fractional duality models with cone function are formulated in a vector...
-
Duality for fractional interval-valued optimization problem via convexificator
In the current study, non-differentiable fractional interval-valued optimization problem (NFIVP) is studied by considering generalized invex...
-
A fuzzy programming approach to neutrosophic complex nonlinear programming problem of real functions in complex variables via lexicographic order
In this article, a complex nonlinear programming problem with objective function coefficients characterized by neutrosophic numbers and fuzzy...
-
Elements of Convex Analysis. Linear Theorems of the Alternative. Tangent Cones
Mathematical programming theory is strictly connected with Convex Analysis. We give in the present section the main concepts and definitions...
-
Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
This paper concentrates on studying multiobjective semi-infinite programming with vanishing constraints. Firstly, the necessary and sufficient...