On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
From MaRDI portal
Publication:693550
DOI10.1016/J.APM.2011.11.051zbMATH Open1252.90075OpenAlexW2089739134MaRDI QIDQ693550FDOQ693550
Authors: Bahram Alidaee, Haibo Wang 
Publication date: 7 December 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.11.051
Recommendations
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- scientific article; zbMATH DE number 3909181
- On the existence of duality gaps for mixed integer programming
- Necessary and sufficient constraint qualification for surrogate duality
Cites Work
- Nonlinear integer programming
- Title not available (Why is that?)
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Integrated supply chain planning under uncertainty using an improved stochastic approach
- Surrogate Mathematical Programming
- Surrogate Constraint Duality in Mathematical Programming
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- An overview of heuristic solution methods
- An Aggregate Constraint Method for Non-Linear Programming
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Development of a new approach for deterministic supply chain network design
- Aggregation of constraints in integer programming
- Aggregation of equations in integer programming
- Simple and fast surrogate constraint heuristics for the maximum independent set problem
- Title not available (Why is that?)
- Tutorial on surrogate constraint approaches for optimization in graphs
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- \(p\)th power Lagrangian method for integer programming
- Surrogate duality in a branch-and-bound procedure for integer programming
- A result in surrogate duality for certain integer programming problems
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- Convexification and existence of a saddle point in a \(p\)th-power reformulation for nonconvex constrained optimization.
- A new approach based on the surrogating method in the project time compression problems
- Polynomial-Time Aggregation of Integer Programming Problems
- A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
- AN IMPROVED SURROGATE CONSTRAINTS METHOD FOR SEPARABLE NONLINEAR INTEGER PROGRAMMING
- On the existence of duality gaps for mixed integer programming
- Aggregating diophantine equations
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
Cited In (5)
- Duality theory in Atanassov's intuitionistic fuzzy mathematical programming problems: optimistic, pessimistic and mixed approaches
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Title not available (Why is that?)
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- Three algorithms for graph locally harmonious colouring
This page was built for publication: On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693550)
