Jointly constrained bilinear programs and related problems: An overview
From MaRDI portal
Recommendations
- A linear programming approach to solving a jointly constrained bilinear programming problem with special structure
- Mixed-integer bilinear programming problems
- A linear programming approach to solving bilinear programmes
- scientific article; zbMATH DE number 4209912
- scientific article; zbMATH DE number 4104722
Cites work
- scientific article; zbMATH DE number 3747003 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- scientific article; zbMATH DE number 3338972 (Why is no real title available?)
- A Method for Solving the Indefinite Quadratic Programming Problem
- A bilinear programming formulation of the 3-dimensional assignment problem
- A cutting plane algorithm for solving bilinear programs
- A cutting plane algorithm for the bilinear programming problem
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A linear max—min problem
- A method for solving maximum-problems with a nonconcave quadratic objective function
- A variable dimension algorithm for the linear complementarity problem
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- An implicit enumeration procedure for the general linear complementarity problem
- Bilinear programming: An exact algorithm
- Bimatrix Equilibrium Points and Mathematical Programming
- Complementary pivot theory of mathematical programming
- Enumerative techniques for solving some nonconvex global optimization problems
- Equilibrium Points in Finite Games
- Equilibrium Points of Bimatrix Games
- Global Optimization Approach to the Linear Complementarity Problem
- Global minimization of indefinite quadratic problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Jointly Constrained Biconvex Programming
- Lagrange Multipliers and Nonconvex Programs
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Maximization of A convex quadratic function under linear constraints
- Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- On the minimization of quadratic functions with bilinear constraints via augmented Lagrangians
- Plastic-elastic torsion, optimal stopping and free boundaries
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Technical Note—Complementary Programming
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Indefinite Quadratic Programming Problem
- The bilinear programming problem
- Two-person nonzero-sum games and quadratic programming
Cited in
(45)- Duality bound method for the general quadratic programming problem with quadratic constraints
- Mixed-integer bilinear programming problems
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Design of planar articulated mechanisms using branch and bound
- A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- A bilinear approach to the pooling problem†
- Solution of a large-scale two-stage decision and scheduling problem using decomposition
- A global supply chain model with transfer pricing and transportation cost allocation
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case
- Global optimization for the biaffine matrix inequality problem
- 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
- Rigorous filtering using linear relaxations
- Ellipsoidal buffered area under the curve maximization model with variable selection in credit risk estimation
- Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- \(H_\infty\) optimization-based decentralized control of linear interconnected systems with nonlinear interconnections
- Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers
- A piecewise linearization framework for retail shelf space management models
- Matrix criteria for the pseudo-P-convexity of a quadratic form
- Algorithms for separable nonlinear least squares with application to modelling time-resolved spectra
- Generalized bilinear programming: An application in farm management
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Primal-relaxed dual global optimization approach
- Identification of mechanical properties of arteries with certification of global optimality
- A new technique for generating quadratic programming test problems
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- On the global solution of multi-parametric mixed integer linear programming problems
- A rigorous global filtering algorithm for quadratic constraints
- Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms
- An application of Lipschitzian global optimization to product design
- New multi-commodity flow formulations for the pooling problem
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- Note on solving linear complementarity problems as jointly constrained bilinear programs
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- scientific article; zbMATH DE number 1495709 (Why is no real title available?)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- A jointly constrained bilinear programming method for solving generalized Cournot-Pareto models
This page was built for publication: Jointly constrained bilinear programs and related problems: An overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918873)
