Degeneracy removal in cutting plane methods for disjoint bilinear programming
From MaRDI portal
Publication:519763
DOI10.1007/s11590-016-1016-6zbMath1368.90152OpenAlexW2282950302MaRDI QIDQ519763
Ji-hong Zhang, Xiao-song Ding, Xi Chen
Publication date: 5 April 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1016-6
Related Items (2)
An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems ⋮ Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bilinear modeling solution approach for fixed charge network flow problems
- A review of recent advances in global optimization
- Jointly constrained bilinear programs and related problems: An overview
- Bidimensional packing by bilinear programming
- Quasi-concave minimization subject to linear constraints
- A symmetrical linear maxmin approach to disjoint bilinear programming
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- Cutting-planes for programs with disjunctive constraints
- Jointly Constrained Biconvex Programming
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Convergent Algorithms for Minimizing a Concave Function
- The bilinear programming problem
- A cutting plane algorithm for solving bilinear programs
- Bilinear programming: An exact algorithm
- Polyhedral annexation in mixed integer and combinatorial programming
- A cutting plane algorithm for the bilinear programming problem
- Polyhedral convexity cuts and negative edge extensions
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- A simple finite cone covering algorithm for concave minimization
- Concavity cuts for disjoint bilinear programming
This page was built for publication: Degeneracy removal in cutting plane methods for disjoint bilinear programming
