AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS

DOI10.1142/S1793557112500325zbMath1261.90061OpenAlexW2054086078MaRDI QIDQ4900102

Kalpana Dahiya, Vanita Verma, Vikas Kumar Sharma

Publication date: 11 January 2013

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557112500325

zbMATH Keywords

extreme pointsbox constraintsnonlinear programmingbilevel programming

Mathematics Subject Classification ID

Integer programming (90C10) Fractional programming (90C32) Extreme-point and pivoting methods (90C49)

Cites Work

• Unnamed Item
• Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
• Convex two-level optimization
• An algorithm for the mixed-integer nonlinear bilevel programming problem
• Bilevel and multilevel programming: A bibliography review
• The steepest descent direction for the nonlinear bilevel programming problem
• The bilevel linear/linear fractional programming problem
• Bilevel linear programming
• A globally convergent algorithm for a class of bilevel nonlinear programming problem
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• An algorithm for the integer linear fractional bilevel programming problem
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Two-Level Linear Programming
• The Mixed Integer Linear Bilevel Programming Problem
• The Direct Power of Adjacent Vertex Programming Methods

This page was built for publication: AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS