On the public citation graph
On invexity-type nonlinear programming problems
0 signed · 34 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00935361openalex-snapshot
Duality in generalized fractional programming via Farkas' lemma
inferredcites →https://doi.org/10.1007/bf00939335openalex-snapshot
Saddle-point type optimality criteria for generalized fractional programming
inferredcites →https://doi.org/10.1007/bf00940006openalex-snapshot
Generalized fractional programming duality: A parametric approach
inferredcites →https://doi.org/10.1007/bf02591683openalex-snapshot
Necessary and sufficient conditions in constrained optimization
inferredcites →https://doi.org/10.1007/bf02591908openalex-snapshot
Duality in generalized linear fractional programming
inferredcites →https://doi.org/10.1007/bf02592224openalex-snapshot
Erratum to: Duality in generalized linear fractional programming
inferredcites →https://doi.org/10.1016/0022-247x(81)90123-2openalex-snapshot
On sufficiency of the Kuhn-Tucker conditions
inferredcites →https://doi.org/10.1016/0022-247x(85)90099-xopenalex-snapshot
Optimality criteria in nonlinear programming involving nonconvex functions
inferredcites →https://doi.org/10.1016/0022-247x(88)90309-5openalex-snapshot
Equivalence of saddle-points and optima, and duality for a class of non-smooth non-convex problems
inferredcites →https://doi.org/10.1016/0022-247x(88)90313-7openalex-snapshot
Optimality criteria in mathematical programming involving generalized invexity
inferredcites →https://doi.org/10.1016/0898-1221(77)90071-2openalex-snapshot
Nonlinear Programming Analysis and Methods
inferredcites →https://doi.org/10.1017/s0004972700004895openalex-snapshot
Invex functions and constrained local minima
inferredcites →https://doi.org/10.1017/s1446788700014865openalex-snapshot
A 4-chromatic graph with a special plane drawing
inferredcites →https://doi.org/10.1017/s1446788700022126openalex-snapshot
Invex functions and duality
inferredcites →https://doi.org/10.1137/0323003openalex-snapshot
Sufficiency of Exact Penalty Minimization
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.4474openalex-snapshot
The minimal criterion for the equivalence between local and global optimal solutions in nondifferentiable optimization problem
inferred← citeshttps://doi.org/10.1006/jmaa.1996.0270openalex-snapshot
Necessary Conditions for Suboptimization over the Weakly Efficient Set Associated to Generalized Invex Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-9640-4_5openalex-snapshot
A Derivative for Semipreinvex Functions and Its Applications in Semipreinvex Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46823-0_21openalex-snapshot
Generalized Convexity in the Light of Nonsmooth Analysis
inferred← citeshttps://doi.org/10.1007/s10898-010-9610-0openalex-snapshot
Second-order Kuhn-Tucker invex constrained problems
inferred← citeshttps://doi.org/10.1007/s11424-011-8234-xopenalex-snapshot
Generalized invexity-type conditions in constrained optimization
inferred← citeshttps://doi.org/10.1007/s11590-010-0250-6openalex-snapshot
On the optimality of some classes of invex problems
inferred← citeshttps://doi.org/10.1007/s12597-016-0253-xopenalex-snapshot
On the Fritz John saddle point problem for differentiable multiobjective optimization
inferred← citeshttps://doi.org/10.1016/j.jmaa.2009.02.035openalex-snapshot
Optimality conditions for an isolated minimum of order two in C1 constrained optimization
inferred← citeshttps://doi.org/10.1080/02331939608844178openalex-snapshot
Continuous-time generalized fractional programming
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/02331939908844438openalex-snapshot
A fifth bibliography of fractional programming*
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.