Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
From MaRDI portal
Cited in
(26)- Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms
- A new solution to optimization-satisfaction problems by a penalty method
- Generalized Farkas' theorem and optimization of infinitely constrained problems
- Hierarchical optimization: An introduction
- Production and marketing decisions with multiple objectives in a competitive environment
- Bilevel and multilevel programming: A bibliography review
- Dependence of bilevel mathematical programs on irrelevant constraints
- An evolutionary algorithm using duality-base-enumerating scheme for interval linear bilevel programming problems
- Two level hierarchical time minimizing transportation problem
- Bilevel linear programming
- An overview of bilevel optimization
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions
- Review of formulations for structural and mechanical system optimization
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP)
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Solving multi-mode resource-constrained multi-project scheduling problem with combinatorial auction mechanisms
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization
- Three modeling paradigms in mathematical programming
- A fully Bayesian approach to bilevel problems
- An efficient solution approach to capacitated bilevel time minimizing transportation problem
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- Bilevel time minimizing transportation problem
This page was built for publication: Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044388)
