Pages that link to "Item:Q3910323"
From MaRDI portal
The following pages link to A Representation and Economic Interpretation of a Two-Level Programming Problem (Q3910323):
Displayed 43 items.
- Stackelberg solutions to multiobjective two-level linear programming problems (Q1969466) (← links)
- Robust strategic bidding in auction-based markets (Q1991246) (← links)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
- Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
- Perfect competition vs. strategic behaviour models to derive electricity prices and the influence of renewables on market power (Q2011832) (← links)
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- Optimal storage and transmission investments in a bilevel electricity market model (Q2177811) (← links)
- Particle swarm optimization for computing Nash and Stackelberg equilibria in energy markets (Q2226473) (← links)
- Joint optimization of product family configuration and scaling design by Stackelberg game (Q2255949) (← links)
- Electricity market clearing with improved scheduling of stochastic production (Q2256346) (← links)
- Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming (Q2269808) (← links)
- Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
- Bilevel linear programming (Q2368110) (← links)
- Interactive balance space approach for solving multi-level multi-objective programming problems (Q2372234) (← links)
- Basic theoretical foundations and insights on bilevel models and their applications to power systems (Q2400021) (← links)
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints (Q2442073) (← links)
- Survivable network design under optimal and heuristic interdiction scenarios (Q2460119) (← links)
- Disjunctive cuts for continuous linear bilevel programming (Q2463829) (← links)
- Parametric global optimisation for bilevel programming (Q2465486) (← links)
- Pareto optimality for bi-level programming problem with fuzzy parameters. (Q2467830) (← links)
- Single- and multi-objective defensive location problems on a network (Q2469584) (← links)
- A hybrid neural network approach to bilevel programming problems (Q2470556) (← links)
- New branch-and-Cut algorithm for bilevel linear programming (Q2471104) (← links)
- An overview of bilevel optimization (Q2480262) (← links)
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience (Q2488050) (← links)
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach (Q2569100) (← links)
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (Q2629907) (← links)
- Incentive strategies with threats in dynamic constrained-stackelberg problems. a bilevel programming approach (Q2785404) (← links)
- A Cutting Plane Approach for Solving Linear Bilevel Programming Problems (Q2808063) (← links)
- On a stochastic bilevel programming problem (Q2892149) (← links)
- Models for Optimization of Power Systems (Q3462315) (← links)
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms (Q3565458) (← links)
- The polynomial hierarchy and a simple model for competitive analysis (Q3716806) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
- Reduction of the bilevel stochastic optimization problem with quantile objective function to a mixed‐integer problem (Q4624952) (← links)
- Semidefinite relaxation for linear programs with equilibrium constraints (Q4921222) (← links)
- Inverse Optimization with Noisy Data (Q4971385) (← links)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (Q5144791) (← links)
- Bi-level optimization based on fuzzy if-then rule (Q5147634) (← links)
- The Standard Pessimistic Bilevel Problem (Q5231679) (← links)
- Solving bi-level programming problem with fuzzy random variable coefficients (Q5275908) (← links)
- A DC Algorithm for Solving Quadratic-linear Bilevel Optimization Problems (Q5356976) (← links)