On the public citation graph

Fractional programming without differentiability

https://doi.org/10.1007/bf01580396
0 signed · 32 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/bf01418765openalex-snapshot
Nonlinear maximal monotone operators in Banach space
inferredcites →https://doi.org/10.1007/bf01951364openalex-snapshot
Duality for nonlinear fractional programs
inferredcites →https://doi.org/10.1007/bf01951417openalex-snapshot
Duality in nonlinear fractional programming
inferredcites →https://doi.org/10.1007/bf02026600openalex-snapshot
Parameter-free convex equivalent and dual programs of fractional programming problems
inferredcites →https://doi.org/10.1090/qam/135625openalex-snapshot
A duality theorem for non-linear programming
inferredcites →https://doi.org/10.1137/1009007openalex-snapshot
Seven Kinds of Convexity
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2140/pjm.1964.14.243openalex-snapshot
On the monotonicity of the gradient of a convex function
inferredcites →https://doi.org/10.2307/2005191openalex-snapshot
Necessary Conditions for an Extremum

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jmaa.1999.6288openalex-snapshot
Optimality Conditions for Vector Mathematical Programming via a Theorem of the Alternative
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_10openalex-snapshot
Fractional Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46709-7_4openalex-snapshot
Convex Directional Derivatives in Optimization
inferred← citeshttps://doi.org/10.1007/978-981-13-0860-4_12openalex-snapshot
Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems
inferred← citeshttps://doi.org/10.1007/bf00934352openalex-snapshot
About differentiability of order one of quasiconvex functions onR n
inferred← citeshttps://doi.org/10.1007/bf00934364openalex-snapshot
Equivalence between a generalized fenchel duality theorem and a saddle-point theorem for fractional programs
inferred← citeshttps://doi.org/10.1007/bf00941889openalex-snapshot
Optimality conditions and duality in subdifferentiable multiobjective fractional programming
inferred← citeshttps://doi.org/10.1007/bf01917106openalex-snapshot
A generalized Farkas lemma with applications to quasidifferentiable programming
inferred← citeshttps://doi.org/10.1007/bf01917115openalex-snapshot
Bibliography in fractional programming
inferred← citeshttps://doi.org/10.1007/bf03398503openalex-snapshot
Constrained Vector Valued Ratio Games and Generalized Subdifferentiable Multiobjective Fractional Minmax Programming
inferred← citeshttps://doi.org/10.1007/s10288-020-00470-xopenalex-snapshot
Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints
inferred← citeshttps://doi.org/10.1007/s11117-024-01052-5openalex-snapshot
Second-order strong optimality and duality for nonsmooth multiobjective fractional programming with constraints
inferred← citeshttps://doi.org/10.1007/s11750-014-0347-7openalex-snapshot
First- and second-order optimality conditions for multiobjective fractional programming
inferred← citeshttps://doi.org/10.1017/s0004972700001908openalex-snapshot
Generalized convexity in nondifferentiable programming
inferred← citeshttps://doi.org/10.1017/s1446788700022126openalex-snapshot
Invex functions and duality
inferred← citeshttps://doi.org/10.1051/proc:072016openalex-snapshot
Glimpses upon quasiconvex analysis
inferred← citeshttps://doi.org/10.1057/jors.1983.221openalex-snapshot
Progress in Nondifferentiable Optimisation
inferred← citeshttps://doi.org/10.1080/02331934.2020.1819276openalex-snapshot
Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems
inferred← citeshttps://doi.org/10.1080/02331934.2021.2002328openalex-snapshot
Second-order optimality conditions in locally Lipschitz multiobjective fractional programming problem with inequality constraints
inferred← citeshttps://doi.org/10.1080/02331939608844249openalex-snapshot
Duality for minmax programming involving nonsmooth v-invex functions
inferred← citeshttps://doi.org/10.1080/09720510.2003.10701068openalex-snapshot
Wolfe type duality involving nonsmooth (B, η) -invex functions for a minmax programming problem
inferred← citeshttps://doi.org/10.24033/msmf.261openalex-snapshot
New concepts in nondifferentiable programming
inferred← citeshttps://doi.org/10.47749/t/unicamp.1988.48044openalex-snapshot
Tecnicas de otimização não diferenciavel e aplicações
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.