scholarly journals Weak Sharp Minima in Set-Valued Optimization Problems

2012 ◽  
Vol 2012 ◽  
pp. 1-9
Author(s):  
Ming-hao Jin ◽  
Jun-xiang Wang ◽  
Shu Xu
Keyword(s):  
Necessary Conditions ◽  
Optimization Problems ◽  
Nonlinear Scalarization Function ◽  
Nonlinear Scalarization ◽  
Outer Limit ◽  
Sufficient And Necessary Conditions ◽  
Scalarization Function ◽  
Weak Sharp ◽  
Sharp Minima

We introduce the notion of a weakψ-sharp minimizer for set-valued optimization problems. We present some sufficient and necessary conditions that a pair point is a weakψ-sharp minimizer through the outer limit of set-valued map and develop the characterization of the weakψ-sharp minimizer in terms of a generalized nonlinear scalarization function. These results extend the corresponding ones in Studniarski (2007).

scholarly journals A Characterization ofE-Benson Proper Efficiency via Nonlinear Scalarization in Vector Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Ke Quan Zhao ◽  
Yuan Mei Xia ◽  
Hui Guo
Keyword(s):  
Vector Optimization ◽  
Optimization Problems ◽  
Proper Efficiency ◽  
Vector Optimization Problems ◽  
Nonlinear Scalarization Function ◽  
Nonlinear Scalarization ◽  
Benson Proper Efficiency ◽  
Scalarization Function

A class of vector optimization problems is considered and a characterization ofE-Benson proper efficiency is obtained by using a nonlinear scalarization function proposed by Göpfert et al. Some examples are given to illustrate the main results.

scholarly journals Necessary Conditions for Weak Sharp Minima in Cone-Constrained Optimization Problems

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
W. Y. Zhang ◽  
S. Xu ◽  
S. J. Li
Keyword(s):  
Normal Cone ◽  
Necessary Conditions ◽  
Optimization Problems ◽  
Necessary Condition ◽  
Directional Derivatives ◽  
Weak Sharp Minima ◽  
Dini Directional Derivatives ◽  
Cone Constrained Optimization ◽  
Weak Sharp ◽  
Sharp Minima

We study weak sharp minima for optimization problems with cone constraints. Some necessary conditions for weak sharp minima of higher order are established by means of upper Studniarski or Dini directional derivatives. In particular, when the objective and constrained functions are strict derivative, a necessary condition is obtained by a normal cone.

scholarly journals LP Well-Posedness for Bilevel Vector Equilibrium and Optimization Problems with Equilibrium Constraints

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Phan Quoc Khanh ◽  
Somyot Plubtieng ◽  
Kamonrat Sombut
Keyword(s):  
Equilibrium Problems ◽  
Optimization Problems ◽  
Well Posedness ◽  
Equilibrium Constraints ◽  
Vector Equilibrium Problems ◽  
Nonlinear Scalarization Function ◽  
Nonlinear Scalarization ◽  
Measures Of Noncompactness ◽  
Scalarization Function ◽  
Vector Equilibrium

The purpose of this paper is introduce several types of Levitin-Polyak well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints. Base on criterion and characterizations for these types of Levitin-Polyak well-posedness we argue on diameters and Kuratowski’s, Hausdorff’s, or Istrǎtescus measures of noncompactness of approximate solution sets under suitable conditions, and we prove the Levitin-Polyak well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints. Obtain a gap function for bilevel vector equilibrium problems with equilibrium constraints using the nonlinear scalarization function and consider relations between these types of LP well-posedness for bilevel vector optimization problems with equilibrium constraints and these types of Levitin-Polyak well-posedness for bilevel vector equilibrium problems with equilibrium constraints under suitable conditions; we prove the Levitin-Polyak well-posedness for bilevel equilibrium and optimization problems with equilibrium constraints.

CHARACTERIZATION OF THE EXISTENCE OF GALLED-TREE NETWORKS

2006 ◽  
Vol 04 (06) ◽  
pp. 1309-1328 ◽  
Author(s):  
ARVIND GUPTA ◽  
JÁN MAŇUCH ◽  
XIAOHONG ZHAO ◽  
LADISLAV STACHO
Keyword(s):  
Necessary Conditions ◽  
Simple Algorithm ◽  
Complete Characterization ◽  
Necessary Condition ◽  
Tree Networks ◽  
Tree Network ◽  
Sufficient And Necessary Conditions

In this paper, we give a complete characterization of the existence of a galled-tree network in the form of simple sufficient and necessary conditions for both root-known and root-unknown cases. As a by-product we obtain a simple algorithm for constructing galled-tree networks. We also introduce a new necessary condition for the existence of a galled-tree network similar to bi-convexity.

Efficient Constrained Combinatorial Auctions

2016 ◽  
Vol 18 (03) ◽  
pp. 1650007
Author(s):  
Anat Lerner ◽  
Rica Gonen
Keyword(s):  
Necessary Conditions ◽  
Dominant Strategy ◽  
Single Item ◽  
Constrained Efficiency ◽  
Incentive Compatible ◽  
Sufficient And Necessary Conditions ◽  
Multidimensional Types ◽  
The Individual ◽  
Efficient Mechanisms

The seminal work by Green and Laffont [(1977) characterization of satisfactory mechanisms for the revelation of preferences for public goods, Econometrica 45, 427–438] shows that efficient mechanisms with Vickrey–Clarke–Groves prices satisfy the properties of dominant-strategy incentive compatible (DSIC) and individually rational in the quasilinear utilities model. Nevertheless in many real-world situations some players have a gap between their willingness to pay and their ability to pay, i.e., a budget. We show that once budgets are integrated into the model then Green and Laffont’s theorem ceases to apply. More specifically, we show that even if only a single player has budget constraints then there is no deterministic efficient mechanism that satisfies the individual rationality and DSIC properties. Furthermore, in a quasilinear utilities model with [Formula: see text] nonidentical items and [Formula: see text] players with multidimensional types, we characterize the sufficient and necessary conditions under which Green and Laffont’s theorem holds in the presence of budget-constrained players. Interestingly our characterization is similar in spirit to that of Maskin [(2000) Auctions, development and privatization: Efficient auctions with liquidity-constrained buyers, Eur. Econ. Rev. 44, 667–681] for Bayesian single-item constrained-efficiency auctions.

scholarly journals Scalarization and well-posedness for set optimization using coradiant sets

Filomat ◽  
2019 ◽  
Vol 33 (11) ◽  
pp. 3457-3471
Author(s):  
Bin Yao ◽  
Sheng Li
Keyword(s):  
Optimization Problem ◽  
Set Optimization ◽  
Well Posedness ◽  
Nonlinear Scalarization Function ◽  
Nonlinear Scalarization ◽  
Scalar Optimization ◽  
Set Optimization Problem ◽  
Order Relations ◽  
Scalarization Function

The aim of this paper is to study scalarization and well-posedness for a set-valued optimization problem with order relations induced by a coradiant set. We introduce the notions of the set criterion solution for this problem and obtain some characterizations for these solutions by means of nonlinear scalarization. The scalarization function is a generalization of the scalarization function introduced by Khoshkhabar-amiranloo and Khorram. Moveover, we define the pointwise notions of LP well-posedness, strong DH-well-posedness and strongly B-well-posedness for the set optimization problem and characterize these properties through some scalar optimization problem based on the generalized nonlinear scalarization function respectively.

Sign in / Sign up

Export Citation Format

Share Document