Efficiency conditions for multiobjective bilevel programming problems via convexificators (Q5152038): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.23952/jnva.4.2020.3.05 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4234891635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary optimality conditions for bilevel optimization problems using convexificators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for the bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of the bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and duality in nonsmooth multiobjective optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order necessary optimality conditions for general bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New necessary optimality conditions in optimistic bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and a sufficient optimality condition for bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalarization and optimality conditions for vector equilibrium problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth calculus, minimality, and monotonicity of convexificators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for optimistic bilevel programming problem using convexifactors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary optimality conditions in terms of convexificators in Lipschitz optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexificators and necessary conditions for efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for efficiency via convexificators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary optimality conditions for Stackelberg problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and duality results for bilevel programming problem using convexifactors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for bilevel programming problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:42, 24 July 2024

scientific article; zbMATH DE number 7312298
Language Label Description Also known as
English
Efficiency conditions for multiobjective bilevel programming problems via convexificators
scientific article; zbMATH DE number 7312298

    Statements

    Efficiency conditions for multiobjective bilevel programming problems via convexificators (English)
    0 references
    0 references
    0 references
    18 February 2021
    0 references
    multiobjective bilevel programming problem
    0 references
    efficiency conditions
    0 references
    constraint qualifications
    0 references
    convexificators
    0 references
    0 references
    0 references
    0 references

    Identifiers