Search

Abstract: In many papers on consumer theory and production analysis duality results between profit, revenue, cost, input, output and shortage functions are established. This functions are associated to certain subsets of ℝn. The aim of this paper is to study in a systematic way such duality results in locally convex spaces and to derive them under minimal hypotheses.

The global solutions of the problem of maximizing a convex function on a convex set were characterized by several authors using the Fenchel (approximate) subdifferential. When the objective function is quasiconvex it was considered the differentiable case or used the Clarke subdifferential. The aim of the present paper is to give necessary and sufficient optimality conditions using several subdifferentials adequate for quasiconvex functions. In this way we recover almost all the previous results related to such global maximization problems with simple proofs.The global solutions of the problem of maximizing a convex function on a convex set were characterized by several authors using the Fenchel (approximate) subdifferential. When the objective function is quasiconvex it was considered the differentiable case or used the Clarke subdifferential. The aim of the present paper is to give necessary and sufficient optimality conditions using several subdifferentials adequate for quasiconvex functions. In this way we recover almost all the previous results related to such global maximization problems with simple proofs.

The coefficients of a plant of an abstract control problem are perturbed. It is shown that the characterizations given by Zolezzi for the abstract quadratic control problem in Hilbert spaces remain true for more general functions and spaces.

In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems.

In this paper there are stated asymptotic solvability results which yield a Farkas' lemma for sublinear functions and operators. Applications to duality for homogeneous programming and to necessary optimality conditions for nonlinear programming are given. Some closedness conditions used in the paper are also discussed.

In this paper we give a criterion for d-stability of convex programs and a perturbation result which subsume and generalize some recent results in semi-infinite programming and limiting Lagrangians.

The present note is concerned with the study of the relations between the notions of asymptotic cones introduced by Dedieu and that of recession cones introduced by Luc. Conditions under which these notions coincide are given, as well as the fact that the compactness condition used by Luc is related (more restrictively) to asymptotic compactness. As an application of these notions, a result on proper efficiency in the sense of Lampe, established by Luc in finite dimensions, is extended to the infinite-dimensional case.

In this paper, we study conditioning problems for convex and nonconvex functions defined on normed linear spaces. We extend the notion of upper Lipschitzness for multivalued functions introduced by Robinson, and show that this concept ensures local conditioning in the nonconvex case via an abstract subdifferential; in the convex case, we obtain complete characterizations of global conditioning in terms of an extension of the upper-Lipschitz property.