✦ LIBER ✦

Nondifferentiable mathematical programming and convex-concave functions

✍ Scribed by S. Tanimoto

Publisher: Springer
Year: 1980
Tongue: English
Weight: 520 KB
Volume: 31
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf01262976

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strictly quasi-convex (concave) function

Strictly quasi-convex (concave) functions and duality in mathematical programming

✍ S Karamardian 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 621 KB

Mathematical programming problems with q

Mathematical programming problems with quasi-convex objective functions

✍ Jacques A. Ferland 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 183 KB

A system of inequalities and nondifferen

A system of inequalities and nondifferentiable mathematical programming

✍ C. Singh 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 318 KB

Global solutions of mathematical program

Global solutions of mathematical programs with intrinsically concave functions

✍ U. Passy 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 815 KB

Sums of increasing convex and increasing

Sums of increasing convex and increasing concave functions

✍ Dominique Thon; Lars Thorlund-Petersen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 294 KB

Higher order symmetric duality in nondif

Higher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions

✍ Ravi P. Agarwal; Izhar Ahmad; Anurag Jayswal 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 281 KB

A pair of Mond-Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K -F -convexity assumptions. Our results generalize several known results in the literature.