On the public citation graph

?-duality theorem of nondifferentiable nonconvex multiobjective programming

0 signed · 88 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00933437openalex-snapshot

Duality theory in multiobjective programming

inferredcites →https://doi.org/10.1007/bf00933511openalex-snapshot

Some minimax theorems in vector-valued functions

inferredcites →https://doi.org/10.1007/bf00933935openalex-snapshot

Necessary conditions for optimality of nondifferentiable convex multiobjective programming

inferredcites →https://doi.org/10.1007/bf00934330openalex-snapshot

Weak Pareto optimality of multiobjective problems in a locally convex linear topological space

inferredcites →https://doi.org/10.1007/bf00935364openalex-snapshot

Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space

inferredcites →https://doi.org/10.1007/bf00936165openalex-snapshot

?-solutions in vector minimization problems

inferredcites →https://doi.org/10.1007/bf00938628openalex-snapshot

Duality theorem of nondifferentiable convex multiobjective programming

inferredcites →https://doi.org/10.1007/bf01442131openalex-snapshot

Pareto optimality in multiobjective problems

inferredcites →https://doi.org/10.1007/bf02592056openalex-snapshot

Penalty functions in ε-programming and ε-minimax problems

inferredcites →https://doi.org/10.1007/bf02594782openalex-snapshot

ε-Optimal solutions in nondifferentiable convex programming and some related questions

inferredcites →https://doi.org/10.1007/bfb0120986openalex-snapshot

Necessary conditions for ε-optimality

inferredcites →https://doi.org/10.1016/0022-247x(74)90025-0openalex-snapshot

On the variational principle

inferredcites →https://doi.org/10.1016/0022-247x(77)90183-4openalex-snapshot

A subgradient duality theorem

inferredcites →https://doi.org/10.1016/0022-247x(79)90228-2openalex-snapshot

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0810openalex-snapshot

Nonlinear Multiobjective Programming

inferred← citeshttps://doi.org/10.1006/jmaa.1996.0080openalex-snapshot

ϵ-Pareto Optimality for Nondifferentiable Multiobjective Programming via Penalty Function

inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot

Nonlinear Multiobjective Programming

inferred← citeshttps://doi.org/10.1007/0-387-23639-2_16openalex-snapshot

ε-Optimality for Nonsmooth Programming on a Hilbert Space

inferred← citeshttps://doi.org/10.1007/978-3-642-21114-0_8openalex-snapshot

Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems

inferred← citeshttps://doi.org/10.1007/bf00940327openalex-snapshot

?-Duality theorem of nondifferentiable nonconvex multiobjective programming

inferred← citeshttps://doi.org/10.1007/bf00940328openalex-snapshot

?-Duality theorem of nondifferentiable nonconvex multiobjective programming

inferred← citeshttps://doi.org/10.1007/bf01720705openalex-snapshot

On several concepts for ɛ-efficiency

inferred← citeshttps://doi.org/10.1007/bf02578991openalex-snapshot

Necessary optimality conditions and saddle points for approximate optimization in banach spaces

inferred← citeshttps://doi.org/10.1007/s00186-006-0078-0openalex-snapshot

On Approximate Efficiency in Multiobjective Programming

inferred← citeshttps://doi.org/10.1007/s10107-020-01597-9openalex-snapshot

A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization

inferred← citeshttps://doi.org/10.1007/s10479-020-03740-3openalex-snapshot

Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization

inferred← citeshttps://doi.org/10.1007/s10898-004-5904-4openalex-snapshot

Multiplier Rules and Saddle-Point Theorems for Helbig’s Approximate Solutions in Convex Pareto Problems

inferred← citeshttps://doi.org/10.1007/s10898-012-9994-0openalex-snapshot

ε-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints

inferred← citeshttps://doi.org/10.1007/s10898-016-0495-4openalex-snapshot

Coradiant sets and $$\varepsilon $$ ε -efficiency in multiobjective optimization

inferred← citeshttps://doi.org/10.1007/s10898-024-01415-yopenalex-snapshot

Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach

inferred← citeshttps://doi.org/10.1007/s10898-025-01561-xopenalex-snapshot

Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization

inferred← citeshttps://doi.org/10.1007/s10957-007-9191-3openalex-snapshot

Optimality Conditions for Metrically Consistent Approximate Solutions in Vector Optimization

inferred← citeshttps://doi.org/10.1007/s10957-008-9475-2openalex-snapshot

ε-Optimality and ε-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints

inferred← citeshttps://doi.org/10.1007/s11117-012-0186-4openalex-snapshot

On $${\epsilon}$$ -solutions for convex optimization problems with uncertainty data

inferred← citeshttps://doi.org/10.1007/s11117-015-0350-8openalex-snapshot

Approximate solutions of multiobjective optimization problems

inferred← citeshttps://doi.org/10.1007/s11117-017-0549-yopenalex-snapshot

On approximate solutions for robust convex semidefinite optimization problems

inferred← citeshttps://doi.org/10.1007/s11117-022-00952-8openalex-snapshot

On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization

inferred← citeshttps://doi.org/10.1007/s11117-024-01032-9openalex-snapshot

Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications

inferred← citeshttps://doi.org/10.1007/s11117-024-01090-zopenalex-snapshot

Optimality and duality in nondifferentiable minimax programming problems involving $$\epsilon $$-quasi solutions

inferred← citeshttps://doi.org/10.1007/s11590-011-0402-3openalex-snapshot

Optimality via generalized approximate convexity and quasiefficiency

inferred← citeshttps://doi.org/10.1007/s11590-018-1287-1openalex-snapshot

Optimality conditions for $${\varvec{\epsilon }}$$ ϵ -quasi solutions of optimization problems via $${\varvec{\epsilon }}$$ ϵ -upper convexificators with applications

inferred← citeshttps://doi.org/10.1007/s11590-019-01464-3openalex-snapshot

On approximate solutions and saddle point theorems for robust convex optimization

inferred← citeshttps://doi.org/10.1007/s12597-025-00917-xopenalex-snapshot

$$\mathcal {E}$$-LU-pareto solutions for semi-infinite programs with multiple intervals

inferred← citeshttps://doi.org/10.1007/s12597-025-00971-5openalex-snapshot

$$\mathcal {E}$$-LU-optimal solution for nonsmooth semi-infinite interval-valued problems

inferred← citeshttps://doi.org/10.1007/s40096-014-0128-3openalex-snapshot

Sequential optimality conditions for multiobjective fractional programming problems

inferred← citeshttps://doi.org/10.1007/s40314-024-02830-3openalex-snapshot

Optimality conditions and duality analysis via generalized subdifferentials for $$\epsilon $$-quasi solutions of vector optimization problems

inferred← citeshttps://doi.org/10.1007/s40324-016-0063-3openalex-snapshot

Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems

inferred← citeshttps://doi.org/10.1007/s40324-016-0099-4openalex-snapshot

Approximate quasi efficiency of set-valued optimization problems via weak subdifferential

inferred← citeshttps://doi.org/10.1007/s41980-018-0076-zopenalex-snapshot

Coradiant-Valued Maps and Approximate Solutions in Variable Ordering Structures

inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.02.017openalex-snapshot

A chain rule for ɛ-subdifferentials with applications to approximate solutions in convex Pareto problems

inferred← citeshttps://doi.org/10.1016/j.na.2010.02.012openalex-snapshot

Generalized -quasi-solutions in multiobjective optimization problems: Existence results and optimality conditions

inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00206-6openalex-snapshot

ε-optimality for multiobjective programming on a Banach space

inferred← citeshttps://doi.org/10.1016/s0898-1221(99)00105-4openalex-snapshot

ε-Optimality and duality for multiobjective fractional programming

inferred← citeshttps://doi.org/10.1023/a:1017960629124openalex-snapshot

Approximate Optimal Solutions and Nonlinear Lagrangian Functions*

inferred← citeshttps://doi.org/10.1051/ro/2018028openalex-snapshot

ϵ-Efficient solutions in semi-infinite multiobjective optimization

inferred← citeshttps://doi.org/10.1080/00036811.2026.2720808openalex-snapshot

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty

inferred← citeshttps://doi.org/10.1080/01630560500538789openalex-snapshot

ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function

inferred← citeshttps://doi.org/10.1080/01630560802099274openalex-snapshot

Two Types of Approximate Saddle Points

inferred← citeshttps://doi.org/10.1080/01630563.2016.1261155openalex-snapshot

Necessary and Suﬃcient Conditions for Weak Quasi Eﬃciency in Nonsmooth Multiobjective Problems

inferred← citeshttps://doi.org/10.1080/01630563.2019.1660891openalex-snapshot

Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization

inferred← citeshttps://doi.org/10.1080/02331930802355374openalex-snapshot

ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps

inferred← citeshttps://doi.org/10.1080/02331934.2012.668190openalex-snapshot

Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization

inferred← citeshttps://doi.org/10.1080/02331934.2019.1579212openalex-snapshot

On approximate solutions for nonsmooth robust multiobjective optimization problems

inferred← citeshttps://doi.org/10.1080/02331934.2020.1763990openalex-snapshot

Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty

inferred← citeshttps://doi.org/10.1080/02331934.2021.1871730openalex-snapshot

Characterizations of robust ε -quasi optimal solutions for nonsmooth optimization problems with uncertain data

inferred← citeshttps://doi.org/10.1080/02331934.2022.2105214openalex-snapshot

Approximate solutions for robust multiobjective optimization programming in Asplund spaces

inferred← citeshttps://doi.org/10.1080/02331934.2025.2466043openalex-snapshot

Optimality and duality for approximate solutions of multiobjective optimization problems involving intersection of closed sets

inferred← citeshttps://doi.org/10.1080/02331939208843858openalex-snapshot

Countably orderable sets and their applications in optimization

inferred← citeshttps://doi.org/10.1080/02331939708844289openalex-snapshot

A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions

inferred← citeshttps://doi.org/10.1080/02331939808844406openalex-snapshot

ε-approximate solutions in multiobjective optimization

inferred← citeshttps://doi.org/10.1080/10556788.2014.945448openalex-snapshot

Characterizing ϵ-properly efficient solutions

inferred← citeshttps://doi.org/10.1081/nfa-100108312openalex-snapshot

ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION

inferred← citeshttps://doi.org/10.1134/s1990478909010116openalex-snapshot

Domination, discretization, and scalarization

inferred← citeshttps://doi.org/10.1137/05062648xopenalex-snapshot

A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems

inferred← citeshttps://doi.org/10.1142/s0217595904000199openalex-snapshot

APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING

inferred← citeshttps://doi.org/10.1155/2007/19323openalex-snapshot

Generalized Augmented Lagrangian Problem and Approximate Optimal Solutions in Nonlinear Programming

inferred← citeshttps://doi.org/10.1155/2010/363012openalex-snapshot

ϵ-Duality Theorems for Convex Semidefinite Optimization Problems with Conic Constraints

inferred← citeshttps://doi.org/10.1155/2011/175327openalex-snapshot

"Equation missing" -Optimal Solutions in Nonconvex Semi-Infinite Programs with Support Functions

inferred← citeshttps://doi.org/10.11650/twjm/1500407131openalex-snapshot

ɛ-OPTIMALITY AND DUALITY FOR FRACTIONAL PROGRAMMING

inferred← citeshttps://doi.org/10.1186/1029-242x-2014-501openalex-snapshot

On ϵ-solutions for robust fractional optimization problems

inferred← citeshttps://doi.org/10.1186/1687-1812-2011-6openalex-snapshot

On ε-optimality conditions for multiobjective fractional optimization problems

inferred← citeshttps://doi.org/10.3390/axioms12111029openalex-snapshot

On Mond–Weir-Type Robust Duality for a Class of Uncertain Fractional Optimization Problems

inferred← citeshttps://doi.org/10.3934/math.2022132openalex-snapshot

On robust weakly $ \varepsilon $-efficient solutions for multi-objective fractional programming problems under data uncertainty

inferred← citeshttps://doi.org/10.48550/arxiv.0805.3947openalex-snapshot

Nonstandard Models and Optimization

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.