Duality in disjunctive programming via vector optimization
β Scribed by Siegfried Helbig
- Publisher
- Springer-Verlag
- Year
- 1994
- Tongue
- English
- Weight
- 999 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we study the saddle point optimality conditions and Lagrange duality in multiobjective optimization for generalized subconvex-like functions. We obtain results which will allow us to characterize the solutions for multiobjective programming problems from the saddle point conditions and
This paper is concerned with the study of necessary and sufficient optimality conditions for convex-concave generalized fractional disjunctive programming problems for which the decision set is the union of a family of convex sets. The Lagrangian function for such problems is defined and the Kuhn-Tu
In this paper, conjugate duality results for convexlike set-valued vector optimization problems are presented under closedness or boundedness hypotheses. Some properties of the value mapping of a set-valued vector optimization problem are studied. A conjugate duality result is also proved for a conv