Solving Bilevel Problems With Polyhedral Constraint Set

Journal of Applied and Numerical Optimization
doi 10.23952/jano.1.2019.3.04
Full Text
Abstract

Available in full text

Date
Authors

Unknown

Publisher

Mathematical Research Press

Related search

Solving Partial Constraint Satisfaction Problems With Tree Decomposition

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2002English

Solving the Set Equilibrium Problems

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2011English

Solving Quasiconcave Bilevel Programming Problem

American Journal of Operations Research
2017English

A Constraint Functional Logic Language for Solving Combinatorial Problems

2003English

Robust Set Operations on Polyhedral Solids

IEEE Computer Graphics and Applications
Computer GraphicsComputer-Aided DesignSoftware
1989English

Combining Systematic and Local Search for Approximately Solving Fuzzy Constraint Satisfaction Problems

Transactions of the Japanese Society for Artificial Intelligence
Artificial IntelligenceSoftware
2006English

Optimality Conditions for Pessimistic Semivectorial Bilevel Programming Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2014English

Constraint Satisfaction Problems With Infinite Templates

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

The Generalized Mangasarian-Fromowitz Constraint Qualification and Optimality Conditions for Bilevel Programs

Journal of Optimization Theory and Applications
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy