A note on duality in disjunctive programming
โ Scribed by E. Balas
- Publisher
- Springer
- Year
- 1977
- Tongue
- English
- Weight
- 291 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 work, we establish a strong duality theorem for Mond-Weir type multiobjective higher-order nondifferentiable symmetric dual programs. This fills some gaps in the work of Chen [X. Chen, Higher-order symmetric duality in nondifferentiable multiobjective programming problems, J. Math. Anal. App