Pages that link to "Item:Q452341"

The following pages link to On linear programs with linear complementarity constraints (Q452341):

Displaying 22 items.

• Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints (Q320925) (← links)
• An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
• Three modeling paradigms in mathematical programming (Q607499) (← links)
• A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
• An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
• Optimization-free robust MPC around the terminal region (Q1626887) (← links)
• Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
• Computing equilibrium prices for a capital asset pricing model with heterogeneous beliefs and margin-requirement constraints (Q1752159) (← links)
• A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
• Nonconvex robust programming via value-function optimization (Q2028490) (← links)
• Convexification techniques for linear complementarity constraints (Q2045009) (← links)
• On independent cliques and linear complementarity problems (Q2095085) (← links)
• A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem (Q2228402) (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• A non-probabilistic methodology for reliable sustainability planning: an application to the Iraqi national irrigation system (Q2281810) (← links)
• On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
• Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
• Convexification Techniques for Linear Complementarity Constraints (Q3009774) (← links)
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
• On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)