Calculating surrogate constraints
From MaRDI portal
Publication:3916382
DOI10.1007/BF01581647zbMath0464.90067OpenAlexW2017515054WikidataQ56324207 ScholiaQ56324207MaRDI QIDQ3916382
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581647
algorithmconvergencesubgradient methodssurrogate dualitysurrogate constraintsLagrangean methodsgeneralised programming
Numerical mathematical programming methods (65K05) Convex programming (90C25) Integer programming (90C10) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Numerical methods based on nonlinear programming (49M37)
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, A surrogate heuristic for set covering problems, Inexact subgradient methods for quasi-convex optimization problems, Surrogate duality in a branch-and-bound procedure for integer programming, On the complexity of the surrogate dual of 0–1 programming, Hybrid approaches for the two-scenario max-min knapsack problem, A hybrid method for solving nonlinear knapsack problems, Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach, Lagrangean decomposition: A model yielding stronger lagrangean bounds, Fractional programming by lower subdifferentiability techniques, A surrogate and Lagrangian approach to constrained network problems, The multidimensional 0-1 knapsack problem: an overview., Surrogate duality relaxation for job shop scheduling, The design of multiactivity multifacility systems, An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints, Quasiconvex duality theory by generalized conjugation methods, Zero duality gap in surrogate constraint optimization: a concise review of models, A simple procedure for solving a continuous quadratic mathematical model., Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning», Surrogate constraint normalization for the set covering problem, Solving large-scale linear programs by aggregation, Surrogate dual method for multi-dimensional nonlinear knapsack problems, Lagrangean/surrogate relaxation for generalized assignment problems, On duality for Boolean programming, Development of a new approach for deterministic supply chain network design, Relaxation heuristics for a generalized assignment problem, An enumerative algorithm framework for a class of nonlinear integer programming problems, Algorithms for large scale set covering problems, An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem, Zero-one integer programs with few contraints - lower bounding theory, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems, Heuristics and reduction methods for multiple constraints 0-1 linear programming problems, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, On generalized surrogate duality in mixed-integer nonlinear programming, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Cites Work
- Unnamed Item
- Unnamed Item
- Transformation of integer programs to knapsack problems
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Some relationships between lagrangian and surrogate duality in integer programming
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- Surrogate duality in a branch-and-bound procedure
- Technical Note—Computational Experience with Normed and Nonnormed Column-Generation Procedures in Nonlinear Programming
- Bottleneck Linear Programming
- Surrogate Constraint Duality in Mathematical Programming
- Generalized Linear Programming Solves the Dual
- The Generalized Slack Variable Linear Program
- Validation of subgradient optimization
- Surrogate Constraints
- Quasi-Convex Programming
- A Modified Linear Program for Columnar Methods in Mathematical Programming
- A Review of Quasi-Convex Functions
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Surrogate Mathematical Programming
- The Generalized Penalty-Function/Surrogate Model
