Pages that link to "Item:Q1184453"
From MaRDI portal
The following pages link to A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453):
Displaying 13 items.
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (Q857798) (← links)
- A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
- A modified simplex approach for solving bilevel linear programming problems (Q1261406) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- On the solution and complexity of a generalized linear complementarity problem (Q1327430) (← links)
- Generation of disjointly constrained bilinear programming test problems (Q1803651) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- Optimal cycle for a signalized intersection using global optimization and complementarity (Q1939107) (← links)
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
- On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note (Q4718599) (← links)
- A global supply chain model with transfer pricing and transportation cost allocation (Q5925942) (← links)
- Solving American option optimal control problems in financial markets using a novel neural network (Q6593226) (← links)
