A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts

DOI10.1007/BF01581626zbMath0436.90079MaRDI QIDQ3877412

C. M. Shetty, Hanif D. Sherali

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

cutting planetest problemscomputational experiencepolyhedral setdisjunctive cutsfinite algorithmbilinear programming problemdisjunctive face cutspolar cuts

Mathematics Subject Classification ID

Quadratic programming (90C20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

Related Items

Bilinear programming and structured stochastic games, On a stochastic bilevel programming problem, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, Capacitated, balanced, sequential location-allocation problems on chains and trees, A note on the solution of bilinear programming problems by reduction to concave minimization, A finite procedure to generate feasible points for the extreme point mathematical programming problem, General purpose heuristics for integer programming. I, On characterizing linear complementarity problems as linear programs, Penalty function approach to linear trilevel programming, An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems, A finitely convergent procedure for facial disjunctive programs, Jointly constrained bilinear programs and related problems: An overview, Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, A computational analysis of LCP methods for bilinear and concave quadratic programming, Efficient algorithms for solving rank two and rank three bilinear programming problems, Robust location transportation problems under uncertain demands, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Generalized bilinear programming. I: Models, applications and linear programming relaxation, A new reformulation-linearization technique for bilinear programming problems, A global supply chain model with transfer pricing and transportation cost allocation, Optimization of linear-convex programs, A linear programming approach to solving bilinear programmes, The inverse optimal value problem, Separable concave minimization via partial outer approximation and branch and bound, A survey of network interdiction models and algorithms, Generation of disjointly constrained bilinear programming test problems, Generalized bilinear programming: An application in farm management, The maximization of a function over the efficient set via a penalty function approach, A simple SLP algorithm for solving a class of nonlinear programs, New product introduction against a predator: A bilevel mixed-integer programming approach, Enhanced intersection cutting-plane approach for linear complementarity problems, Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, On the global minimization of concave functions, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, Global optimization algorithms for linearly constrained indefinite quadratic problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-concave minimization subject to linear constraints
• Cutting-planes for programs with disjunctive constraints
• Global Maximization of a Convex Function with Linear Inequality Constraints
• The bilinear programming problem
• A cutting plane algorithm for solving bilinear programs
• Maximization of A convex quadratic function under linear constraints
• Polyhedral annexation in mixed integer and combinatorial programming
• A cutting plane algorithm for the bilinear programming problem
• Optimal Facility Location with Concave Costs
• Polyhedral convexity cuts and negative edge extensions
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Polaroids: A new tool in non‐convex and in integer programming