The Generalized Penalty-Function/Surrogate Model
From MaRDI portal
Cited in
(16)- Zero-one integer programs with few contraints - lower bounding theory
- A duality approach to minimax results for quasi-saddle functions in finite dimensions
- Minimization methods with constraints
- A surrogate heuristic for set covering problems
- A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism
- Johri's general dual, the Lagrangian dual, and the surrogate dual
- Duality theorems for convex and quasiconvex set functions
- Surrogate duality for robust optimization
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A convex-like duality scheme for quasi-convex programs
- Some relationships between lagrangian and surrogate duality in integer programming
- Calculating surrogate constraints
- Necessary and sufficient constraint qualification for surrogate duality
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
This page was built for publication: The Generalized Penalty-Function/Surrogate Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5677298)
