A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
From MaRDI portal
Publication:3877412
DOI10.1007/BF01581626zbMATH Open0436.90079MaRDI QIDQ3877412FDOQ3877412
Authors: Hanif D. Sherali, C. M. Shetty 
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
polyhedral setcutting planetest problemsdisjunctive cutscomputational experiencefinite algorithmbilinear programming problemdisjunctive face cutspolar cuts
Quadratic programming (90C20) Polytopes and polyhedra (52Bxx) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites Work
- Title not available (Why is that?)
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Maximization of A convex quadratic function under linear constraints
- Title not available (Why is that?)
- A cutting plane algorithm for solving bilinear programs
- Title not available (Why is that?)
- Optimal Facility Location with Concave Costs
- Quasi-concave minimization subject to linear constraints
- Cutting-planes for programs with disjunctive constraints
- The bilinear programming problem
- 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
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Title not available (Why is that?)
- Polaroids: A new tool in non‐convex and in integer programming
Cited In (41)
- 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
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- A finitely convergent procedure for facial disjunctive programs
- 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
- A disjunctive cutting plane algorithm for bilinear programming
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- 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
- A dual method for polar cuts in disjoint bilinear programming
- Penalty function approach to linear trilevel programming
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Separable concave minimization via partial outer approximation and branch and bound
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)
