A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
From MaRDI portal
Publication:3877412
Cites work
- scientific article; zbMATH DE number 3668340 (Why is no real title available?)
- scientific article; zbMATH DE number 3559278 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3338972 (Why is no real title available?)
- A cutting plane algorithm for solving bilinear programs
- A cutting plane algorithm for the bilinear programming problem
- Cutting-planes for programs with disjunctive constraints
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Maximization of A convex quadratic function under linear constraints
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- Optimal Facility Location with Concave Costs
- Polaroids: A new tool in non‐convex and in integer programming
- Polyhedral annexation in mixed integer and combinatorial programming
- Polyhedral convexity cuts and negative edge extensions
- Quasi-concave minimization subject to linear constraints
- The bilinear programming problem
Cited in
(41)- Separable concave minimization via partial outer approximation and branch and bound
- The inverse optimal value problem
- Efficient algorithms for solving rank two and rank three bilinear programming problems
- Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
- A finitely convergent procedure for facial disjunctive programs
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- A global supply chain model with transfer pricing and transportation cost allocation
- The maximization of a function over the efficient set via a penalty function approach
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
- Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information
- On the global minimization of concave functions
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Jointly constrained bilinear programs and related problems: An overview
- On characterizing linear complementarity problems as linear programs
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- On a stochastic bilevel programming problem
- A new reformulation-linearization technique for bilinear programming problems
- Generation of disjointly constrained bilinear programming test problems
- A survey of network interdiction models and algorithms
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- A disjunctive cutting plane algorithm for bilinear programming
- Enhanced intersection cutting-plane approach for linear complementarity problems
- A note on the solution of bilinear programming problems by reduction to concave minimization
- A linear programming approach to solving bilinear programmes
- Bilinear programming and structured stochastic games
- Robust location transportation problems under uncertain demands
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- Capacitated, balanced, sequential location-allocation problems on chains and trees
- Generalized bilinear programming: An application in farm management
- An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Optimization of linear-convex programs
- New product introduction against a predator: a bilevel mixed-integer programming approach
- A simple SLP algorithm for solving a class of nonlinear programs
- General purpose heuristics for integer programming. I
- Penalty function approach to linear trilevel programming
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- A dual method for polar cuts in disjoint bilinear programming
This page was built for publication: A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3877412)
