Bilinear programming: An exact algorithm
From MaRDI portal
Publication:4138491
Cites work
- Convexity Cuts and Cut Search
- scientific article; zbMATH DE number 3438384 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
Cited in
(33)- An exact penalty on bilevel programs with linear vector optimization lower level
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Bilinear programming and structured stochastic games
- A note on the solution of bilinear programming problems by reduction to concave minimization
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- Hierarchical optimization: An introduction
- Efficient algorithms for solving rank two and rank three bilinear programming problems
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- 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
- Bilevel and multilevel programming: A bibliography review
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- Two-stage robust optimization approach to elective surgery and downstream capacity planning
- Generation of disjointly constrained bilinear programming test problems
- Test problem construction for linear bilevel programming problems
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
- Bilevel linear programming
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Optimization of linear-convex programs
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- Optimization over the efficient set
- A global supply chain model with transfer pricing and transportation cost allocation
- A dual method for polar cuts in disjoint bilinear programming
- Robust optimization for a steel production planning problem with uncertain demand and product substitution
- Hypergraph co-optimal transport: metric and categorical properties
- On the global minimization of concave functions
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Jointly constrained bilinear programs and related problems: An overview
This page was built for publication: Bilinear programming: An exact algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138491)
