Back to search

Optimality conditions for bilevel programming problems

Data up to Jan 2025

Published1995
Citations274
References20

Total Citations Per Year

Abstract

References (20)

Optimization and Nonsmooth Analysis

1990 • 10,305 citations

Convex Analysis

1970 • 9,645 citations

Nonlinear programming

1979 • 852 citations

On the Stackelberg strategy in nonzero-sum games

1973 • 727 citations

The Fritz John necessary optimality conditions in the presence of equality and inequality constraints

1967 • 614 citations

The theory of the market economy

1952 • 569 citations

An explicit solution to the multi-level programming problem

1982 • 493 citations

Weak Sharp Minima in Mathematical Programming

1993 • 363 citations

Nonlinear Programming

1980 • 228 citations

A simple characterization of solution sets of convex programs

1988 • 152 citations

On the numerical solution of a class of Stackelberg problems

1990 • 120 citations

A new computational method for Stackelberg and min-max problems by use of a penalty method

1981 • 109 citations

A necessary and a sufficient optimality condition for bilevel programming problems

1992 • 95 citations

Refinements of necessary optimality conditions in nondifferentiable programming II

1982 • 91 citations

Necessary conditions and sufficient conditions for static minmax problems

1977 • 91 citations

Refinements of necessary optimality conditions in nondifferentiable programming I

1979 • 86 citations

Necessary optimality conditions for Stackelberg problems

1993 • 72 citations

A theoretical approximation scheme for Stackelberg problems

1989 • 59 citations

Problems of Hierarchical Optimization in Finite Dimensions

1994 • 57 citations

A Gauss-Newton Approach to Solving Generalized Inequalities

1986 • 35 citations

Cited By (0)

Loading...