共查询到20条相似文献,搜索用时 9 毫秒
1.
Dinh The Luc 《Mathematical Programming》1990,49(1-3):113-122
This paper presents a study of recession cones of nonconvex sets in infinite dimensional spaces. The results are then applied to investigate efficiency conditions and the domination property in vector optimization.This paper was written when the author was at the University of Erlangen-Nürnberg under a grant of the Alexander von Humboldt-Stiftung.On leave from the Institute of Mathematics, Hanoi, Vietnam. 相似文献
2.
In this paper we focus on minimal points in linear spaces and minimal solutions of vector optimization problems, where the preference relation is defined via an improvement set E. To be precise, we extend the notion of E-optimal point due to Chicco et al. in [4] to a general (non-necessarily Pareto) quasi ordered linear space and we study its properties. In particular, we relate the notion of improvement set with other similar concepts of the literature and we characterize it by means of sublevel sets of scalar functions. Moreover, we obtain necessary and sufficient conditions for E-optimal solutions of vector optimization problems through scalarization processes by assuming convexity assumptions and also in the general (nonconvex) case. By applying the obtained results to certain improvement sets we generalize well-known results of the literature referred to efficient, weak efficient and approximate efficient solutions of vector optimization problems. 相似文献
3.
Johannes O. Royset 《Mathematical Programming》2018,170(2):479-506
Approximation is central to many optimization problems and the supporting theory provides insight as well as foundation for algorithms. In this paper, we lay out a broad framework for quantifying approximations by viewing finite- and infinite-dimensional constrained minimization problems as instances of extended real-valued lower semicontinuous functions defined on a general metric space. Since the Attouch-Wets distance between such functions quantifies epi-convergence, we are able to obtain estimates of optimal solutions and optimal values through bounds of that distance. In particular, we show that near-optimal and near-feasible solutions are effectively Lipschitz continuous with modulus one in this distance. Under additional assumptions on the underlying metric space, we construct approximating functions involving only a finite number of parameters that still are close to an arbitrary extended real-valued lower semicontinuous functions. 相似文献
4.
Let (E, ξ)= ind (En, ξn) be an inductive limit of a sequence (En, ξn)n∈ N of locally convex spaces and let every step (En, ξn) be endowed with a partial order by a pointed convex (solid) cone Sn. In the framework of inductive limits of partially ordered locally convex spaces, the notions of lastingly efficient points, lastingly weakly efficient points and lastingly globally properly efficient points are introduced. For several ordering cones, the notion of non-conflict is introduced. Under the requirement that the sequence (Sn)n∈ N of ordering cones is non-conflicting, an existence theorem on lastingly weakly efficient points is presented. From this, an existence theorem on lastingly globally properly efficient points is deduced. 相似文献
5.
Meetu Bhatia 《Optimization Letters》2012,6(1):17-30
In this paper higher order cone convex, pseudo convex, strongly pseudo convex, and quasiconvex functions are introduced. Higher
order sufficient optimality conditions are given for a weak minimum, minimum, strong minimum and Benson proper minimum solution
of a vector optimization problem. A higher order dual is associated and weak and strong duality results are established under
these new generalized convexity assumptions. 相似文献
6.
In this paper K-nonsmooth quasi-invex and (strictly or strongly) K-nonsmooth pseudo-invex functions are defined. By utilizing these new concepts, the Fritz–John type and Kuhn–Tucker type necessary optimality conditions and number of sufficient optimality conditions are established for a nonsmooth vector optimization problem wherein Clarke’s generalized gradient is used. Further a Mond Weir type dual is associated and weak and strong duality results are obtained. 相似文献
7.
We introduce the notion of sectionwise connected set as a new tool to investigate nonconvex vector optimization. Indeed, the image of a K-convex set through a K-quasiconnected vector function is proved to be sectionwise connected. Some properties of the minimal frontiers of sectionwise connected sets are studied. 相似文献
8.
We show that there exists, for each closed bounded convex set C in the Euclidean plane with nonempty interior, a quadrangle Q having the following two properties. Its sides support C at the vertices of a rectangle r and at least three of the vertices of Q lie on the boundary of a rectangle R that is a dilation of r with ratio 2. We will prove that this implies that quadrangle Q is contained in rectangle R and that, consequently, the inner approximation r of C has an area of at least half the area of the outer approximation Q of C. The proof makes use of alignment or Schüttelung, an operation on convex sets. 相似文献
9.
E. K. Kostousova 《Computational Mathematics and Mathematical Physics》2008,48(6):918-932
New properties of outer polyhedral (parallelepipedal) estimates for reachable sets of linear differential systems are studied. For systems with a stable matrix, it is determined what the orientation matrices are for which the estimates possessing the generalized semigroup property are bounded/unbounded on an infinite time interval. In particular, criteria are found (formulated in terms of the eigenvalues of the system’s matrix and the properties of bounding sets) that guarantee for previously mentioned tangent estimates and estimates with a constant orientation matrix that either there are initial orientation matrices for which the corresponding estimate tubes are bounded or all these tubes are unbounded. For linear stationary systems, a system of ordinary differential equations and algebraic relations is derived that determines estimates with constant orientation matrices for reachable sets that have no generalized semigroup property but are tangent and also bounded if the matrix of the system is stable. 相似文献
10.
Consider linear systems involving affine-linear dependencies on interval parameters. Presented is a free C-XSC software implementing a generalized parametric fixed-point iteration method for verified enclosure of the parametric solution set. Some specific features of the corresponding algorithm concerning sharp enclosure of the contracting matrix and inner approximation of the solution enclosure are discussed. 相似文献
11.
《Optimization》2012,61(11):2171-2193
ABSTRACTThe aim of this paper is to investigate the stability of the solution sets for set optimization problems via improvement sets. Firstly, we consider the relations among the solution sets for optimization problem with set optimization criterion. Then, the closeness and the convexity of solution sets are discussed. Furthermore, the upper semi-continuity, Hausdorff upper semi-continuity and lower semi-continuity of solution mappings to parametric set optimization problems via improvement sets are established under some suitable conditions. These results extend and develop some recent works in this field. 相似文献
12.
In this paper optimality for a nonsmooth vector optimization problem having generalized cone-invex objective and constraint functions is considered. An equivalent $\eta $ -approximated vector optimization problem is constructed by a modification of the objective function. The relationships between weakly efficient solutions and saddle points of the two problems are studied. 相似文献
13.
In this article we discuss the conditions required to guarantee the non-emptiness and the boundedness of certain subsets of the set of Lagrange multipliers for an inequality and equality constrained vector minimization problem. 相似文献
14.
15.
《Optimization》2012,61(7):1107-1116
In this article, we investigate conditions for nonemptiness and compactness of the sets of solutions of pseudomonotone vector variational inequalities by using the concept of asymptotical cones. We show that a pseudomonotone vector variational inequality has a nonempty and compact solution set provided that it is strictly feasible. We also obtain some necessary conditions for the set of solutions of a pseudomonotone vector variational inequality to be nonempty and compact. 相似文献
16.
Zhe Chen 《Applicable analysis》2013,92(12):2457-2467
In this article, we investigate the nonemptiness and compactness of the weak Pareto optimal solution set of a multiobjective optimization problem with functional constraints via asymptotic analysis. We then employ the obtained results to derive the necessary and sufficient conditions of the weak Pareto optimal solution set of a parametric multiobjective optimization problem. Our results improve and generalize some known results. 相似文献
17.
《Optimization》2012,61(3):297-303
Studies on generalizations of the marginal function and the solution multifunction in vector optimization is given. We present sufficient conditions for semicontinuity of the solution multifunction without closedness assumptions. 相似文献
18.
主要研究改进集的一些拓扑运算性质。首先在改进集条件下给出了拓扑向量空间中两个非空集之和的拓扑内部的一些运算性质。进一步,利用改进集获得了 Flores-Baz′an 和 Hern′andez 提出的假定 B 的一个加强形式。此外,给出了一些例子对主要结果进行了解释。 相似文献
19.
Supply chain management (SCM) in semiconductor manufacturing differs from many other SCM applications in that it has to simultaneously
consider both long and short time scale stochasticity and nonlinearity. We present a two-level hierarchical structure for
SCM motivated by these considerations. A linear programming (LP)-based strategic planning module forms the outer loop which
makes long timescale decisions on the starts of factories. A model predictive control (MPC) based tactical execution module
forms the inner loop which generates short timescale decisions on the starts of factories by considering the stochasticity
and nonlinearity on both supply and demand sides. Two representative case studies are examined under diverse realistic conditions
with this integrated framework. It is demonstrated that given conditions of stochasticity, nonlinearity, and forecast error
this hierarchical decision structure can be tuned to manage representative semiconductor manufacturing supply chains in a
manner appealing to operations.
This work was supported by grants from the Intel Research Council and the National Science Foundation (CMMI-0432429). 相似文献
20.
Yu Han 《Optimization》2016,65(7):1337-1347
This paper aims at investigating the continuity of the efficient solution mapping of perturbed vector optimization problems. First, we introduce the concept of the level mapping. We give sufficient conditions for the upper semicontinuity and the lower semicontinuity of the level mapping. The upper semicontinuity and the lower semicontinuity of the efficient solution mapping are established by using the continuity properties of the level mapping. We establish a corollary about the lower semicontinuity of the minimal point set-valued mapping. Meanwhile, we give some examples to illustrate that the corollary is different from the ones in the literature. 相似文献