Titlebook: Optimization and Optimal Control; Theory and Applicati Altannar Chinchuluun,Panos M. Pardalos,Ider Tseve Book 2010 Springer Science+Busine

strain

CHAR

exceptional

不透明

Post-Optimal Analysis of Linear Semi-Infinite Programs,onstraints (but not both) is infinite. In most applications of LSIP to statistics, electronics, telecommunications, and other fields, all the data (or at least part of them) are uncertain. Post-optimal analysis provides answer to questions about the quantitative impact on the optimal value of small

Lacunar-Stroke

On Equilibrium Problems,d in several applied fields we first present its most important particular cases as optimization, Kirszbraun’s problem, saddlepoint (minimax) problems, and variational inequalities. Then, some classical and new results together with their proofs concerning existence of solutions of equilibrium probl

Somber

,Quasi-equilibrium Inclusion Problems of the Blum–Oettli-Type and Related Problems,ial cases, we obtain several results on the existence of solutions of general vector ideal (resp. proper, Pareto, weak) quasi-optimization problems, of quasivariational inequalities, and of quasivariational inclusion problems.

高原

General Quadratic Programming and Its Applications in Response Surface Analysis, is split into convex quadratic maximization, convex quadratic minimization, and indefinite quadratic programming. Based on optimality conditions, we propose finite algorithms for solving those problems. As application, some real practical problems arising in the response surface, one of the main pa

金哥占卜者

Canonical Dual Solutions for Fixed Cost Quadratic Programs,ll-known NP-hard problem in . can be transformed into a continuous concave maximization dual problem over a convex feasible subset of . with zero duality gap. The resulting canonical dual problem can be solved easily, under certain conditions, by traditional convex programming methods. Both existenc

變色龍

Polynomially Solvable Cases of Binary Quadratic Programs,olynomially solvable subclasses revealed in our recent research. It is well known that the binary quadratic programming program is NP-hard in general. Identifying polynomially solvable subclasses of binary quadratic programming problems not only offers theoretical insight into the complicated nature

Hectic

Generalized Solutions of Multi-valued Monotone Quasi-variational Inequalities,a variational selection. Using elliptic regularization for parametric variational inequalities, it is possible to pose another parameter identification problem that gives a stable approximation procedure for the ill-posed problem. The results are quite general and are applicable to ill-posed variati