𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimality conditions for fractional minmax programming

✍ Scribed by Chanchal Singh

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
273 KB
Volume
100
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimality and Duality for Complex Nondi
Optimality and Duality for Complex Nondifferentiable Fractional Programming
✍ Jen-Chwan Liu; Chin-Cheng Lin; Ruey-Lin Sheu πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 276 KB

Both parametric and nonparametric necessary and sufficient optimality conditions are established for a class of complex nondifferentiable fractional programming problems containing generalized convex functions. Subsequently, these optimality criteria are utilized as a basis for constructing one para

Optimality and Duality for Multiobjectiv
Optimality and Duality for Multiobjective Fractional Programming Involvingn-Set Functions
✍ Do Sang Kim; Cheong Lai Jo; Gue Myung Lee πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 160 KB

We consider a multiobjective fractional programming problem MFP involving vector-valued objective n-set functions in which their numerators are different from each other, but their denominators are the same. By using the concept of proper efficiency, we establish optimality conditions and duality re

Optimality Conditions and Duality for Fr
Optimality Conditions and Duality for Fractional Programming Problems Involving Arcwise Connected Functions and Their Generalizations
✍ Sonia Davar; Aparna Mehra πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 126 KB

In this paper, necessary and sufficient optimality conditions are obtained for fractional programming problems involving arcwise connected, P-connected, and Qconnected functions. Duality results have also been established.

Optimality conditions for convex semi-in
Optimality conditions for convex semi-infinite programming problems
✍ A. Ben-Tal; L. Kerzner; S. Zlobec πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 923 KB

## Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories