Výsledky vyhledávání - "Linear program with complementarity constraints"

A pivoting algorithm for linear programming with linear complementarity constraints Autor Fang, Haw-ren, Leyffer, Sven, Munson, Todd

“…We present a pivoting algorithm for solving linear programs with linear complementarity constraints. Our method generalizes the simplex method for linear…”
Získat plný text

Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem Autor Wang, Lizhi

“… In the presented algorithms, linear programs with complementarity constraints (LPCCs) need to be solved repeatedly as a subroutine, which is analogous to repeatedly solving linear programs for MILPs. Therefore, the computational complexity of the PInvMILP algorithms can be expected to be much worse than that of MILP or LPCC. Computational experiments show that small-sized test instances can be solved within a reasonable time period…”
Získat plný text

Relaxations and cutting planes for linear programs with complementarity constraints Autor Del Pia, Alberto, Linderoth, Jeff, Zhu, Haoran

“…We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not independent…”
Získat plný text

A study of the difference-of-convex approach for solving linear programs with complementarity constraints Autor Jara-Moroni, Francisco, Pang, Jong-Shi, Wächter, Andreas

“…) for computing stationary solutions of linear programs with complementarity constraints (LPCCs). We focus on three such formulations and establish connections between their stationary solutions and those of…”
Získat plný text

Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method Autor Zhang, Xinyao, Han, Shaoning, Pang, Jong-Shi

“…Indefinite quadratic programs (QPs) are known to be very difficult to be solved to global optimality, so are linear programs with linear complementarity…”
Získat plný text

Solving linear programs with complementarity constraints using branch-and-cut Autor Yu, Bin, Mitchell, John E., Pang, Jong-Shi

“…A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with…”
Získat plný text

An enhanced logical benders approach for linear programs with complementarity constraints Autor Jara-Moroni, Francisco, Mitchell, John E., Pang, Jong-Shi, Wächter, Andreas

“…This work extends the logical benders approach for solving linear programs with complementarity constraints proposed by Hu et al. (SIAM J Optim 19(1):445–471, 2008) and Bai et al…”
Získat plný text

Methods for Linear Programs with Complementarity Constraints Autor Jara Moroni, Francisco I

“…This thesis studies three approaches for solving linear programs with complementarity constraints (LPCC…”
Získat plný text

On linear bilevel optimization problems with complementarity-constrained lower levels Autor Gabriel, Steven A., Leal, Marina, Schmidt, Martin

“…We consider a novel class of linear bilevel optimization models with a lower level that is a linear program with complementarity constraints (LPCC…”
Získat plný text

Relaxations and Cutting Planes for Linear Programs with Complementarity Constraints Autor Alberto Del Pia, Linderoth, Jeff, Zhu, Haoran

“…We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not independent…”
Získat plný text

Improving the Solution of Indefinite Quadratic Programs and Linear Programs with Complementarity Constraints by a Progressive MIP Method Autor Zhang, Xinyao, Han, Shaoning, Jong-Shi, Pang

“…Indefinite quadratic programs (QPs) are known to be very difficult to be solved to global optimality, so are linear programs with linear complementarity…”
Získat plný text

An LPCC approach to nonconvex quadratic programs Autor Hu, Jing, Mitchell, John E., Pang, Jong-Shi

“…Filling a gap in nonconvex quadratic programming, this paper shows that the global resolution of a feasible quadratic program (QP), which is not known a priori…”
Získat plný text

Solving Linear Programs with Complementarity Constraints using Branch-and-Cut Autor Yu, Bin, Mitchell, John E, Jong-Shi, Pang

“…A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with…”
Získat plný text

Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations Autor Gondzio, Jacek, Yıldırım, E. Alper

“… We propose two alternative formulations. Our first formulation is based on casting a standard quadratic program as a linear program with complementarity constraints…”
Získat plný text

Optimizing dedicated lanes and tolling schemes for connected and autonomous vehicles to address bottleneck congestion considering morning commuter departure choices Autor E. Seilabi, Sania, Pourgholamali, Mohammadhosein, Miralinaghi, Mohammad, Homem de Almeida Correia, Gonçalo, He, Xiaozheng (Sean), Labi, Samuel

Získat plný text

A polyhedral study of nonconvex quadratic programs with box constraints Autor Vandenbussche, Dieter, Nemhauser, George L.

“…By reformulating quadratic programs using necessary optimality conditions, we obtain a linear program with complementarity constraints…”
Získat plný text

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints Autor Kirches, Christian, Larson, Jeffrey, Leyffer, Sven, Manns, Paul

“… Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to obtain an estimate of the active set…”
Získat plný text

Convexification techniques for bilinear and complementarity constraints with application to network interdiction Autor Davarnia, Danial

“…Continuous and discrete bilinear and complementarity constraints are widely used to model engineering and management problems. We study the simultaneous…”
Získat plný text

Global Solutions of Nonconvex Standard Quadratic Programs via Mixed Integer Linear Programming Reformulations Autor Gondzio, Jacek, E Alper Yildirim

“… We propose two alternative mixed integer linear programming formulations. Our first formulation is based on casting a standard quadratic program as a linear program with complementarity constraints…”
Získat plný text

Lift-and-project for general two-term disjunctions Autor Kis, Tamás

“… We apply our results to linear programs with complementarity constraints…”
Získat plný text