Generalized pseudo-convex minmax programming. (Q2468567): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Second order duality for a minimax programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sufficiency of the Kuhn-Tucker conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalised convex mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary conditions and sufficient conditions for static minmax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple derivation of necessary conditions for static minmax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for a class of nondifferentiable mathematical programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5285557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for fractional minimax programming problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf03398537 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2772012207 / rank
 
Normal rank

Latest revision as of 10:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Generalized pseudo-convex minmax programming.
scientific article

    Statements