Three modeling paradigms in mathematical programming

From MaRDI portal
Revision as of 07:51, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (23)

On global search in nonconvex optimal control problemsAn approximation scheme for a class of risk-averse stochastic equilibrium problemsOn convex quadratic programs with linear complementarity constraintsObtaining Tighter Relaxations of Mathematical Programs with Complementarity ConstraintsOn conic QPCCs, conic QCQPs and completely positive programsApplying ranking and selection procedures to long-term mitigation for improved network restorationA relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraintsPenalty method-based equilibrium point approach for solving the linear bilevel multiobjective programming problemDynamic vaccination games and hybrid dynamical systemsA global optimization algorithm for solving a four-person gameMinimizing sequences in a constrained DC optimization problemGlobal optimality conditions for optimal control problems with functions of A.D. AlexandrovOn preserving dissipativity properties of linear complementarity dynamical systems with the \(\theta\)-methodPolymatrix games and optimization problemsUsing quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraintsConstraint qualifications for mathematical programs with equilibrium constraints and their local preservation propertyA relaxation solving approach for the linear trilevel programming problemSolving linear programs with complementarity constraints using branch-and-cutOn computational search for Nash equilibrium in hexamatrix gamesOn a Solving Bilevel D.C.-Convex Optimization ProblemsHybrid global search algorithm with genetic blocks for solving hexamatrix gamesGlobal Search for Bilevel Optimization with Quadratic DataMPEC Methods for Bilevel Optimization Problems


Uses Software



Cites Work




This page was built for publication: Three modeling paradigms in mathematical programming