Linearization procedure and Kortanek-Evans optimality conditions for symmetric pseudo-concave programming

Authors

  • Ştefan Ţigan "Iuliu Hatieganu" University of Medicine and Pharmacy, Cluj-Napoca, Romania
Abstract views: 162

Abstract

Not available.

Downloads

Download data is not yet available.

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

1993-02-01

How to Cite

Ţigan, Ştefan. (1993). Linearization procedure and Kortanek-Evans optimality conditions for symmetric pseudo-concave programming. Rev. Anal. Numér. Théor. Approx., 22(1), 113–120. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1993-vol22-no1-art12

Issue

Section

Articles