Nondifferentiable generalized minimax fractional programming under (Ф,ρ)-invexity

B.B. Upadhyay; T. Antczak; S.K. Mishra; K. Shukla

doi:10.2298/YJOR200915018U

Authors

B.B. Upadhyay Department of Mathematics, Indian Institute of Technology Patna, Patna, India
T. Antczak Faculty of Mathematics and Computer Science, University of Lodz´, Lodz´, Poland
S.K. Mishra Department of Mathematics, Institute of Science, Banaras Hindu University, Varanasi, India
K. Shukla Department of Mathematics, GLA University, Mathura, Mathura, India

DOI:

https://doi.org/10.2298/YJOR200915018U

Keywords:

Nondifferentiable minimax fractional problem, Duality, (Ф,ρ)-invexity, Sufficient conditions

Abstract

In this paper, a class of nonconvex nondifferentiable generalized minimax fractional programming problems is considered. Sufficient optimality conditions for the considered nondifferentiable generalized minimax fractional programming problem are established under the concept of (Φ, ρ)-invexity. Further, two types of dual models are formulated and various duality theorems relating to the primal minimax fractional programming problem and dual problems are established. The results established in the paper generalize and extend several known results in the literature to a wider class of nondifferentiable minimax fractional programming problems. To the best of our knowledge, these results have not been established till now.

References

Antczak, T., “Generalized fractional minimax programming with B-(p,r)-invexity,” Computers & Mathematics with Applications, 56 (6) (2008) 1505–1525.

Antczak, T., “Nonsmooth minimax programming under locally Lipschitz (Φ,ρ)-invexity,” Applied Mathematics and Computation, 217 (1) (2011) 9606–9624.

Antczak, T., Mishra, S. K., and Upadhyay, B. B., “First order duality results for a new class of nonconvex semi-infinite minimax fractional programming problems,” Journal of Advanced Mathematical Studies, 9 (1) (2016) 132–162.

Antczak, T., Mishra, S. K., and Upadhyay, B. B., “Optimality conditions and duality for generalized fractional minimax program involving locally Lipschitz (b,ψ,Φ,ρ)-invexity,” Control and Cybernetics, 47 (1) (2018) 5–32.

Antczak, T., and Singh, V., “Optimality and duality for minimax fractional programming with support functions under B-(p,r)-Type I assumptions,” Mathematical and Computer Modelling, 57 (5-6) (2013) 1083–1100.

Antczak, T., and Stasiak, A., “(Φ,ρ)-invexity in nonsmooth optimization,” Numerical Functional Analysis and Optimization, 32 (1) (2011) 1–25.

Bajona-Xandri, C., “On Fractional Programming,” Masters Thesis, Universitat Autonoma de Barcelona, 1993.

Barrodale, I., “Best rational approximation and strict-quasiconvexity,” SIAM Journal on Numerical Analysis, 10 (1) (1973) 8–12.

Bector, C. R., and Bhatia, B. L., “Sufficient optimality and duality for minimax problem,” Utilitas Mathematica, 27 (1985) 229–247.

Bector, C. R., Chandra, S., and Kumar, V., “Duality for minimax programming involving V-invex functions,” Optimization, 30 (2) (1994) 93–103.

Bram, J., “The Lagrange multiplier theorem for max-min with several constraints,” SIAM Journal on Applied Mathematics, 14 (4) (1966) 665–667.

Caristi, G., Ferrara, M., and Stefanescu, A., “Mathematical programming with (Φ,ρ) invexity,” in: (I.V. Konov, D.T. Luc, A.M. Rubinov), (ed.) Generalized Convexity and Related Topics: Lecture Notes in Economics and Mathematical Systems Springer, Berlin, 2006.

Chandra, S., and Kumar, V., “Duality in fractional minimax programming,” Journal of the Australian Mathematical Society (series A), 58 (3) (1995) 376–386.

Craven, B. D., “Invex functions and constrained local minima,” Bulletin of the Australian Mathematical Society, 24 (3) (1981) 357–366.

Danskin, J. M., “The theory of max-min with applications,” SIAM Journal on Applied Mathematics, 14 (4) (1966) 641–644.

Dubey, R., Mishra, L. N., and Ali, R., “Special class of second-order non-differentiable symmetric duality problems with (G,αf)-pseudobonvexity assumptions,” Mathematics, 7 (8) (2019) 763.

Dubey, R., and Mishra, V. N., “Symmetric duality results for a nondifferentiable multiobjective programming problem,” RAIRO Operations Research, 53 (2) (2019) 539–558.

Dubey, R., Kumar, A., Ali, R., and Mishra, L. N., “New class of G-Wolfe type symmetric duality model and duality relations under Gf bonvexity over arbitrary cones,” Journal of Inequalities and Applications, 30 (1) (2020) 1-16.

Dubey, R., Mishra, L. N., Luis Manuel Sánchez Ruiz, “Nondifferentiable G-Mond-Weir type multiobjective symmetric fractional problem and their duality theorems under generalized assumptions,” Symmetry, 11 (11) (2019) 1348.

Dubey, R., Mishra, V. N., and Ali, R., “Duality for Unified Higher-Order Minimax Fractional Programming with Support Function under Type-I Assumptions,” Mathematics, 7 (11) (2019) 1034.

Dubey, R., Deepmala, and Mishra, V. N., “Higher-order symmetric duality in nondifferentiable multiobjective fractional programming problem over cone constraints,” Statistics, Optimization and Information Computing, 8 (1) (2020) 187–205.

Ferrara, M., and Stefanescu, M. V., “Optimality conditions and duality in multiobjective programming with (Φ,ρ)-invexity,” Yugoslav Journal of Operations Research, 18 (2) (2008) 153–165.

Flouda, C. A., and Pardalos, P. M., eds, *Encyclopedia of Optimization*, 2nd ed Springer, New York, 2009.

Hanson, M. A., “On sufficiency of Kuhn-Tucker conditions,” Journal of Mathematical Analysis and Applications, 30 (1981) 545–550.

Hanson, M. A., and Mond, B., “Further generalizations of convexity in mathematical programming,” Journal of Information and Optimization Sciences, 3 (1) (1982) 22–35.

Husain, I., Hanson, M. A., and Jabeen, Z., “On nondifferentiable minimax fractional programming,” European Journal of Operational Research, 160 (2005) 202-217.

Jayswal, A., “Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity,” ISRN Applied Mathematics, 2011, 1-19.

Jeyakumar, V., “Strong and weak invexity in mathematical programming”, Methods of Operations Research, 55 (1995) 109–125.

Lai, H. C., and Lee, J. C., “On duality theorem for nondifferentiable minimax fractional programming”, Journal of Computational and Applied Mathematics, 146 (1) (2002) 115-126.

Lai, H. C., Liu, J. C., and Tanaka, K., “Necessary and sufficient conditions for minimax fractional programming”, Journal of Mathematical Analysis and Applications, 230 (2) (1999) 311–328.

Liang, Z. A., Huang, H. X., and Pardalos, P. M., “Optimality conditions and duality for nonlinear fractional programming problems”, Journal of Optimization Theory and Applications, 110 (2001) 611–619.

Liang, Z. A., and Shi, J. W., “Optimality conditions and duality for minimax fractional programming with generalized convexity”, Journal of Mathematical Analysis and Applications, 277 (2003) 474–488.

Liu, J. C., and Wu, C. S., “On minimax fractional optimality conditions and (F,ρ) convexity”, Journal of Mathematical Analysis and Applications, 219 (1998) 36–51.

Liu, J. C., Wu, C. S., and Sheu, R. L., “Duality for fractional minimax programming”, Optimization, 41 (2) (2010) 117–133.

Liu, X. L., Lai, G. M., Xu, C. Q., and Yuan, D. H., “On Nonsmooth semi-infinite minimax programming problem with (Φ,ρ)-invexity”, Abstract and Applied Analysis, (3) (2014) 1-7.

Luo, H. Z., and Wu, H. X., “On necessary conditions for a class of nondifferentiable minimax fractional programming”, Journal of Computational and Applied Mathematics, 215 (1) (2008) 103–113.

Mishra, S. K., Pant, R. P., Rautela, J. S., “Generalized α-invexity and nondifferentiable minimax fractional programming”, Journal of Computational and Applied Mathematics, 206 (1) (2007) 122–135.

Mishra, S. K., and Upadhyay, B. B., “Nonsmooth minimax fractional programming involving η-pseudolinear functions”, Optimization, 63 (5) (2014) 775–788.

Mishra, S. K., and Upadhyay, B. B., Pseudolinear Functions and Optimization, Chapman and Hall, CRC Press, UK, 2015.

Mishra, S. K., Wang, S. Y., Lai, K. K., Shi, J. M., “Nondifferentiable minimax fractional programming under generalized univexity”, Journal of Computational and Applied Mathematics, 158 (2) (2003) 379–395.

Preda, V., “On efficiency and duality for multiobjective programs”, Journal of Mathematical Analysis and Applications, 166 (2)(1992) 365–377.

Schmitendorf, W. E., “Necessary conditions and sufficient conditions for static minimax problems”, Journal of Mathematical Analysis and Applications, 57 (1977) 683–693.

Schroeder, R. G., “Linear programming solutions to ratio games”, Operational Research, 18 (1970) 300–305.

Stefanescu, M. V., Stefanescu, A., “On semi-infinite minimax programming with generalized invexity”, Optimization, 61 (11) (2012) 1307–1319.

Upadhyay, B. B., and Mishra, S. K., “Nonsmooth semi-infinite minimax programming involving generalized (Φ,ρ)-invexity”, Journal of Systems Science and Complexity, 28 (4) (2014).

Vial, J. P., “Strong and weak convexity of sets and functions”, Mathematics of Operations Research, 8 (1983) 231–259.

Weir, T., and Mond, B., “Generalized convexity and duality in multiple objective programming”, Bulletin of the Australian Mathematical Society, 39 (2) (1989) 287–299.

Weir, T., “Pseudoconvex minimax programming”, Utilitas Mathematica, 42 (1992) 234-240.

Yang, X. M., and Hou, S. H., “On minimax fractional optimality and duality with generalized convexity”, Journal of Global Optimization, 32 (2005) 235–252.

Yuan, D. H., Liu, X. L., Chinchuluun, A., and Pardalos, P. M., “Nondifferentiable minimax fractional programming with (C,α,ρ,d)-convexity”, Journal of Optimization Theory and Applications, 129 (1) (2006) 185–199.

Nondifferentiable generalized minimax fractional programming under (Ф,ρ)-invexity

Authors

DOI:

Keywords:

Abstract

References

Downloads

Published

Issue

Section

License