Three modeling paradigms in mathematical programming

From MaRDI portal
Publication:607499

DOI10.1007/s10107-010-0395-1zbMath1202.90254OpenAlexW2139624848MaRDI QIDQ607499

Jong-Shi Pang

Publication date: 22 November 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0395-1



Related Items

On global search in nonconvex optimal control problems, An approximation scheme for a class of risk-averse stochastic equilibrium problems, On convex quadratic programs with linear complementarity constraints, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, On conic QPCCs, conic QCQPs and completely positive programs, Applying ranking and selection procedures to long-term mitigation for improved network restoration, A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints, Penalty method-based equilibrium point approach for solving the linear bilevel multiobjective programming problem, Dynamic vaccination games and hybrid dynamical systems, A global optimization algorithm for solving a four-person game, Minimizing sequences in a constrained DC optimization problem, Global optimality conditions for optimal control problems with functions of A.D. Alexandrov, On preserving dissipativity properties of linear complementarity dynamical systems with the \(\theta\)-method, Polymatrix games and optimization problems, Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints, Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property, A relaxation solving approach for the linear trilevel programming problem, Solving linear programs with complementarity constraints using branch-and-cut, On computational search for Nash equilibrium in hexamatrix games, On a Solving Bilevel D.C.-Convex Optimization Problems, Hybrid global search algorithm with genetic blocks for solving hexamatrix games, Global Search for Bilevel Optimization with Quadratic Data, MPEC Methods for Bilevel Optimization Problems


Uses Software


Cites Work