zbMATH — the first resource for mathematics

Saddlepoint theory for nondifferentiable multiobjective fractional programming. (English) Zbl 0593.90077
Summary: A saddlepoint theory is developed for the nondifferentiable multiobjective fractional programming problem. Necessary and sufficient conditions of Fritz John and Kuhn-Tucker type are established. As expected, only necessary conditions require convexity restrictions. All functions are assumed to be nondifferentiable.

90C32 Fractional programming
90C31 Sensitivity, stability, parametric optimization
90C30 Nonlinear programming
Full Text: DOI
[1] Bhatia D., Management Science 16 pp 604– (1970) · Zbl 0218.90053
[2] Bitran G.R., Journal of Optimization Theory and Applications 35 pp 367– (1981) · Zbl 0445.90082
[3] Datta N., Journal of Information & Optimization Sciences 3 pp 262– (1982) · Zbl 0498.90075
[4] Kanniappan P., Journal of optimization Theory and Applications 40 pp 167– (1983) · Zbl 0488.49007
[5] Mangasarian O., Nonlinear Programming (1969)
[6] Pascoletti A., Journal of Optimization Theory and Applications 42 pp 499– (1984) · Zbl 0505.90072
[7] Stadler W., Journal of Optimization Theory and Applications 29 pp 1– (1979) · Zbl 0388.90001
[8] Tang Y., Journal of Mathematical Analysis and Applications 96 pp 505– (1983) · Zbl 0527.49018
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.