Pages that link to "Item:Q607499"

The following pages link to Three modeling paradigms in mathematical programming (Q607499):

Displaying 23 items.

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