default search action
Tadeusz Antczak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Tadeusz Antczak:
On optimality for fuzzy optimization problems with granular differentiable fuzzy objective functions. Expert Syst. Appl. 240: 121891 (2024) - [j40]Tadeusz Antczak, Kalpana Shukla:
Optimality and duality results for non-smooth vector optimisation problems with K-V-type I functions via local cone approximations. Int. J. Math. Oper. Res. 28(3): 374-395 (2024) - 2023
- [j39]Tadeusz Antczak:
On directionally differentiable multiobjective programming problems with vanishing constraints. Ann. Oper. Res. 328(2): 1181-1212 (2023) - [j38]Tadeusz Antczak:
Optimality conditions for invex nonsmooth optimization problems with fuzzy objective functions. Fuzzy Optim. Decis. Mak. 22(1): 1-21 (2023) - [j37]Tadeusz Antczak, Kalpana Shukla:
Local cone approximations in non-smooth K-univex multi-objective programming problems. Int. J. Math. Oper. Res. 26(4): 425-448 (2023) - 2022
- [j36]Tadeusz Antczak:
Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints. 4OR 20(3): 417-442 (2022) - [j35]Tadeusz Antczak:
On the exact l1 penalty function method for convex nonsmooth optimization problems with fuzzy objective function. Soft Comput. 26(21): 11627-11643 (2022) - 2021
- [j34]Tadeusz Antczak, Najeeb Abdulaleem:
E -differentiable minimax programming under E -convexity. Ann. Oper. Res. 300(1): 1-22 (2021) - [j33]Tadeusz Antczak:
A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems. Comput. Manag. Sci. 18(1): 49-71 (2021) - [j32]Pushkar Jaisawal, Tadeusz Antczak, Vivek Laha:
On sufficiency and duality for semi-infinite multiobjective optimisation problems involving V-invexity. Int. J. Math. Oper. Res. 18(4): 465-483 (2021)
2010 – 2019
- 2019
- [j31]Tadeusz Antczak:
Exactness of the absolute value penalty function method for nonsmooth -invex optimization problems. Int. Trans. Oper. Res. 26(4): 1504-1526 (2019) - [j30]Anurag Jayswal, Tadeusz Antczak, Shalini Jha:
On equivalence between a variational problem and its modified variational problem with the η-objective function under invexity. Int. Trans. Oper. Res. 26(5): 2053-2070 (2019) - 2018
- [j29]Tadeusz Antczak:
Exactness Property of the Exact Absolute Value Penalty Function Method for Solving Convex Nondifferentiable Interval-Valued Optimization Problems. J. Optim. Theory Appl. 176(1): 205-224 (2018) - 2016
- [j28]Tadeusz Antczak:
Optimality Conditions in Quasidifferentiable Vector Optimization. J. Optim. Theory Appl. 171(2): 708-725 (2016) - [j27]Tadeusz Antczak:
The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming. Optim. Lett. 10(7): 1561-1576 (2016) - 2015
- [j26]Tadeusz Antczak:
Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints. Int. J. Comput. Math. 92(5): 882-907 (2015) - [j25]Tadeusz Antczak:
Sufficient optimality criteria and duality for multiobjective variational control problems with G-type I objective and constraint functions. J. Glob. Optim. 61(4): 695-720 (2015) - 2014
- [j24]Tadeusz Antczak, G. J. Zalmai:
Second order (φ, ρ)-V-invexity and duality for semi-infinite minimax fractional programming. Appl. Math. Comput. 227: 831-856 (2014) - [j23]Tadeusz Antczak:
Comments on "Sufficiency and duality for multiobjective variational control problems with G-invexity" Computers and Mathematics with Applications 63, 838-850 (2012). Comput. Math. Appl. 66(12): 2595-2596 (2014) - [j22]Tadeusz Antczak:
On efficiency and mixed duality for a new class of nonconvex multiobjective variational control problems. J. Glob. Optim. 59(4): 757-785 (2014) - 2013
- [j21]Tadeusz Antczak:
A Lower Bound for the Penalty Parameter in the Exact Minimax Penalty Function Method for Solving Nondifferentiable Extremum Problems. J. Optim. Theory Appl. 159(2): 437-453 (2013) - [j20]Tadeusz Antczak, Vinay Singh:
Optimality and duality for minimax fractional programming with support functions under B-(p, r)-Type I assumptions. Math. Comput. Model. 57(5-6): 1083-1100 (2013) - 2012
- [j19]Tadeusz Antczak:
The vector exact l1 penalty method for nondifferentiable convex multiobjective programming problems. Appl. Math. Comput. 218(18): 9095-9106 (2012) - 2011
- [j18]Tadeusz Antczak:
A new exact exponential penalty function method and nonconvex mathematical programming. Appl. Math. Comput. 217(15): 6652-6662 (2011) - [j17]Tadeusz Antczak:
Nonsmooth minimax programming under locally Lipschitz (Φ, ρ)-invexity. Appl. Math. Comput. 217(23): 9606-9624 (2011) - [j16]Tadeusz Antczak:
Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method. J. Comput. Appl. Math. 235(17): 4991-5000 (2011) - [j15]Tadeusz Antczak:
Saddle points criteria via a second order η -approximation approach for nonlinear mathematical programming involving second order invex functions. Kybernetika 47(2): 222-240 (2011) - [j14]Tadeusz Antczak:
A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with G-invex functions. Math. Comput. Model. 54(1-2): 59-68 (2011) - [j13]Tadeusz Antczak:
The l1 exact G-penalty function method and G-invex mathematical programming problems. Math. Comput. Model. 54(9-10): 1966-1978 (2011) - [c1]Tadeusz Antczak:
The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems. System Modelling and Optimization 2011: 461-470 - 2010
- [j12]Tadeusz Antczak:
The L1 Penalty Function Method for Nonconvex differentiable Optimization Problems with inequality Constraints. Asia Pac. J. Oper. Res. 27(5): 559-576 (2010) - [j11]Tadeusz Antczak:
Saddle points criteria in nondifferentiable multiobjective programming with V-invex functions via an eta-approximation method. Comput. Math. Appl. 60(9): 2689-2700 (2010)
2000 – 2009
- 2009
- [j10]Tadeusz Antczak:
Exact penalty functions method for mathematical programming problems involving invex functions. Eur. J. Oper. Res. 198(1): 29-36 (2009) - [j9]Tadeusz Antczak:
On G-invex multiobjective programming. Part I. Optimality. J. Glob. Optim. 43(1): 97-109 (2009) - [j8]Tadeusz Antczak:
On G-invex multiobjective programming. Part II. Duality. J. Glob. Optim. 43(1): 111-140 (2009) - [j7]Tadeusz Antczak:
Optimality and duality for nonsmooth multiobjective programming problems with V-r-invexity. J. Glob. Optim. 45(2): 319-334 (2009) - 2008
- [j6]Tadeusz Antczak:
Generalized fractional minimax programming with B-(p, r)-invexity. Comput. Math. Appl. 56(6): 1505-1525 (2008) - 2006
- [j5]Tadeusz Antczak:
An eta-Approximation Approach in Nonlinear Vector Optimization with Univex Functions. Asia Pac. J. Oper. Res. 23(4): 525-542 (2006) - 2004
- [j4]Tadeusz Antczak:
(p, r)-Invexity in multiobjective programming. Eur. J. Oper. Res. 152(1): 72-87 (2004) - [j3]Tadeusz Antczak:
Minimax programming under (p, r)-invexity. Eur. J. Oper. Res. 158(1): 1-19 (2004) - 2003
- [j2]Tadeusz Antczak:
A New Approach to Multiobjective Programming with a Modified Objective Function. J. Glob. Optim. 27(4): 485-495 (2003) - 2002
- [j1]Tadeusz Antczak:
Multiobjective programming under d-invexity. Eur. J. Oper. Res. 137(1): 28-36 (2002)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint