Tadeusz Antczak

Orcid: 0000-0002-2218-7668

According to our database1, Tadeusz Antczak authored at least 41 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On optimality for fuzzy optimization problems with granular differentiable fuzzy objective functions.
Expert Syst. Appl., 2024

2023
On directionally differentiable multiobjective programming problems with vanishing constraints.
Ann. Oper. Res., September, 2023

Optimality conditions for invex nonsmooth optimization problems with fuzzy objective functions.
Fuzzy Optim. Decis. Mak., March, 2023

Local cone approximations in non-smooth <i>K</i>-univex multi-objective programming problems.
Int. J. Math. Oper. Res., 2023

2022
On the exact l<sub>1</sub> penalty function method for convex nonsmooth optimization problems with fuzzy objective function.
Soft Comput., 2022

Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints.
4OR, 2022

2021
On sufficiency and duality for semi-infinite multiobjective optimisation problems involving V-invexity.
Int. J. Math. Oper. Res., 2021

A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems.
Comput. Manag. Sci., 2021

E -differentiable minimax programming under E -convexity.
Ann. Oper. Res., 2021

2019
On equivalence between a variational problem and its modified variational problem with the η-objective function under invexity.
Int. Trans. Oper. Res., 2019

Exactness of the absolute value penalty function method for nonsmooth -invex optimization problems.
Int. Trans. Oper. Res., 2019

2018
Exactness Property of the Exact Absolute Value Penalty Function Method for Solving Convex Nondifferentiable Interval-Valued Optimization Problems.
J. Optim. Theory Appl., 2018

2016
The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming.
Optim. Lett., 2016

Optimality Conditions in Quasidifferentiable Vector Optimization.
J. Optim. Theory Appl., 2016

2015
Sufficient optimality criteria and duality for multiobjective variational control problems with G-type I objective and constraint functions.
J. Glob. Optim., 2015

Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints.
Int. J. Comput. Math., 2015

2014
On efficiency and mixed duality for a new class of nonconvex multiobjective variational control problems.
J. Glob. Optim., 2014

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., 2014

Second order (φ, ρ)-V-invexity and duality for semi-infinite minimax fractional programming.
Appl. Math. Comput., 2014

2013
Optimality and duality for minimax fractional programming with support functions under <i>B</i>-(<i>p</i>, <i>r</i>)-Type I assumptions.
Math. Comput. Model., 2013

A Lower Bound for the Penalty Parameter in the Exact Minimax Penalty Function Method for Solving Nondifferentiable Extremum Problems.
J. Optim. Theory Appl., 2013

2012
The vector exact l<sub>1</sub> penalty method for nondifferentiable convex multiobjective programming problems.
Appl. Math. Comput., 2012

2011
The l<sub>1</sub> exact G-penalty function method and G-invex mathematical programming problems.
Math. Comput. Model., 2011

A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with G-invex functions.
Math. Comput. Model., 2011

Saddle points criteria via a second order η -approximation approach for nonlinear mathematical programming involving second order invex functions.
Kybernetika, 2011

Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method.
J. Comput. Appl. Math., 2011

Nonsmooth minimax programming under locally Lipschitz (Φ, ρ)-invexity.
Appl. Math. Comput., 2011

A new exact exponential penalty function method and nonconvex mathematical programming.
Appl. Math. Comput., 2011

The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems.
Proceedings of the System Modeling and Optimization, 2011

2010
Saddle points criteria in nondifferentiable multiobjective programming with V-invex functions via an eta-approximation method.
Comput. Math. Appl., 2010

The L<sub>1</sub> Penalty Function Method for Nonconvex differentiable Optimization Problems with inequality Constraints.
Asia Pac. J. Oper. Res., 2010

2009
Optimality and duality for nonsmooth multiobjective programming problems with <i>V</i>-<i>r</i>-invexity.
J. Glob. Optim., 2009

On <i>G</i>-invex multiobjective programming. Part II. Duality.
J. Glob. Optim., 2009

On <i>G</i>-invex multiobjective programming. Part I. Optimality.
J. Glob. Optim., 2009

Exact penalty functions method for mathematical programming problems involving invex functions.
Eur. J. Oper. Res., 2009

2008
Generalized fractional minimax programming with B-(p, r)-invexity.
Comput. Math. Appl., 2008

2006
An eta-Approximation Approach in Nonlinear Vector Optimization with Univex Functions.
Asia Pac. J. Oper. Res., 2006

2004
(p, r)-Invexity in multiobjective programming.
Eur. J. Oper. Res., 2004

Minimax programming under (p, r)-invexity.
Eur. J. Oper. Res., 2004

2003
A New Approach to Multiobjective Programming with a Modified Objective Function.
J. Glob. Optim., 2003

2002
Multiobjective programming under d-invexity.
Eur. J. Oper. Res., 2002


  Loading...