Linearization procedure and Kortanek-Evans optimality conditions for symmetric pseudo-concave programming
Abstract
Not available.Downloads
References
Bector, C.R., Jolly, P.L., Programming problems with pseudomonotonic objectives Optimization, 15 (1984), 2, pp. 217-229, https://doi.org/10.1080/02331938408842927
Kortanek, K.O., Evans, J.P., Pseudo-concave Programming and Lagrange regularity, Oper. Res., 15 (1967), pp. 882-891.
Mangasarian, O.L., Nonlinear Programming, New York et al., McGraw-Hill, 1969.
Martos, B., Nonlinear Programming Theory and Methods, Amsterdam-Oxford, North-Holland, 1975.
Minch, R.A., Applications of symmetric derivatives in mathematical programming, Math. Prog., 1 (1971), pp. 307-320, https://doi.org/10.1007/bf01584095
Tigan, S., On the linearization technique for quasimontonic optimizaiton problems, Analyse Num. Theor. Approx., (1983), 12, 1, pp. 89-96.
Tigan, S., On duality for generalized pseudomonotonic programming, Analyse Num. Theor. Approx., 20, (1991), 1-2, pp. 111-116.
Weber, R., Pseudomonotonic Multiobjective Programming, Discussion Papers B8203, Institute of Operations Research, Univ. of Saarland, Saarbruecken, 1982.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 Journal of Numerical Analysis and Approximation Theory
This work is licensed under a Creative Commons Attribution 4.0 International License.
Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.