排序方式: 共有50条查询结果,搜索用时 500 毫秒
1.
Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union
of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of
verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated
systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which
can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key
roles in solving large scale knowledge-based data classification problems where they are used to describe the containments
as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which
was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments. 相似文献
2.
3.
4.
A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval
of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval.
This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system.
Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01.
Research supported by CONACyT of Mexico, Grant 130036.
Research partially supported by CONACyT of Mexico, Grant 44003. 相似文献
5.
This paper presents an exhaustive approach to optimality theory in semi-infinite linear programming, placing a special emphasis on generality. After surveying optimality conditions for general problems, a detailed analysis is made of problems in which the coefficients are continuous functions of a parameter which varies on a compact set, adopting a feasible directions approach. Lastly, the case of analytical coefficients over an interval is considered in some detail. 相似文献
6.
Mathematical Programming - The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, and the isolated efficient solutions of a given vector optimization... 相似文献
7.
Miguel A. Goberna Mercedes Larriqueta Virginia N. Vera de Serio 《Journal of Computational and Applied Mathematics》2008
Many mathematical programming models arising in practice present a block structure in their constraint systems. Consequently, the feasibility of these problems depends on whether the intersection of the solution sets of each of those blocks is empty or not. The existence theorems allow to decide when the intersection of non-empty sets in the Euclidean space, which are the solution sets of systems of (possibly infinite) inequalities, is empty or not. In those situations where the data (i.e., the constraints) can be affected by some kind of perturbations, the problem consists of determining whether the relative position of the sets is preserved by sufficiently small perturbations or not. This paper focuses on the stability of the non-empty (empty) intersection of the solutions of some given systems, which can be seen as the images of set-valued mappings. We give sufficient conditions for the stability, and necessary ones as well; in particular we consider (semi-infinite) convex systems and also linear systems. In this last case we discuss the distance to ill-posedness. 相似文献
8.
N. Dinh M. A. Goberna M. A. López T. H. Mo 《Journal of Optimization Theory and Applications》2017,173(2):357-390
The main purpose of this paper consists of providing characterizations of the inclusion of the solution set of a given conic system posed in a real locally convex topological space into a variety of subsets of the same space defined by means of vector-valued functions. These Farkas-type results are used to derive characterizations of the weak solutions of vector optimization problems (including multiobjective and scalar ones), vector variational inequalities, and vector equilibrium problems. 相似文献
9.
This paper analyzes the effect on the optimal value of a given linear semi-infinite programming problem of the kind of perturbations which more frequently arise in practical applications: those which affect the objective function and the right-hand-side coefficients of the constraints. In particular, we give formulae which express the exact value of a perturbed problem as a linear function of the perturbation. 相似文献
10.
Redundant constraints in linear inequality systems can be characterized as those inequalities that can be removed from an
arbitrary linear optimization problem posed on its solution set without modifying its value and its optimal set. A constraint
is saturated in a given linear optimization problem when it is binding at the optimal set. Saturation is a property related
with the preservation of the value and the optimal set under the elimination of the given constraint, phenomena which can
be seen as weaker forms of excess information in linear optimization problems. We say that an inequality of a given linear
inequality system is uniformly saturated when it is saturated for any solvable linear optimization problem posed on its solution
set. This paper characterizes the uniform saturated inequalities and other related classes of inequalities.
This work was supported by the MCYT of Spain and FEDER of UE, Grant BFM2002-04114-C02-01. 相似文献