Pages that link to "Item:Q4138491"
From MaRDI portal
The following pages link to Bilinear programming: An exact algorithm (Q4138491):
Displayed 30 items.
- Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- An exact penalty on bilevel programs with linear vector optimization lower level (Q1011256) (← links)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- Bilinear programming and structured stochastic games (Q1076625) (← links)
- A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
- A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
- Hierarchical optimization: An introduction (Q1184516) (← links)
- Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
- Generalized bilinear programming. I: Models, applications and linear programming relaxation (Q1199512) (← links)
- The maximization of a function over the efficient set via a penalty function approach (Q1278284) (← links)
- A simple SLP algorithm for solving a class of nonlinear programs (Q1278946) (← links)
- Bilevel and multilevel programming: A bibliography review (Q1338535) (← links)
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems (Q1388924) (← links)
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- Two-stage robust optimization approach to elective surgery and downstream capacity planning (Q1753397) (← links)
- Generation of disjointly constrained bilinear programming test problems (Q1803651) (← links)
- Test problem construction for linear bilevel programming problems (Q1815062) (← links)
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (Q2195296) (← links)
- Bilevel linear programming (Q2368110) (← links)
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) (← links)
- Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes (Q2804545) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Optimization of linear-convex programs (Q3835613) (← links)
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
- Optimization over the efficient set (Q5896268) (← links)
- A global supply chain model with transfer pricing and transportation cost allocation (Q5925942) (← links)