Pages that link to "Item:Q3877412"

The following pages link to A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412):

Displaying 39 items.

• Robust location transportation problems under uncertain demands (Q496635) (← links)
• 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)
• 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 finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
• A finitely convergent procedure for facial disjunctive programs (Q1159568) (← links)
• A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← 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)
• A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
• A linear programming approach to solving bilinear programmes (Q1207310) (← links)
• Generalized bilinear programming: An application in farm management (Q1266521) (← 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)
• General purpose heuristics for integer programming. I (Q1365114) (← links)
• Penalty function approach to linear trilevel programming (Q1379973) (← links)
• The inverse optimal value problem (Q1769073) (← links)
• Generation of disjointly constrained bilinear programming test problems (Q1803651) (← links)
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
• An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems (Q2181561) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming (Q2329684) (← links)
• Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information (Q2449369) (← links)
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
• Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
• Capacitated, balanced, sequential location-allocation problems on chains and trees (Q2638927) (← links)
• On a stochastic bilevel programming problem (Q2892149) (← links)
• On characterizing linear complementarity problems as linear programs (Q3471881) (← links)
• New product introduction against a predator: A bilevel mixed-integer programming approach (Q3655566) (← links)
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
• Optimization of linear-convex programs (Q3835613) (← links)
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
• A global supply chain model with transfer pricing and transportation cost allocation (Q5925942) (← links)