Degenerate quadratic programming and lp approximation problems
نویسندگان
چکیده
منابع مشابه
Quadratic bi-level programming problems: a fuzzy goal programming approach
This paper presents a fuzzy goal programming (FGP) methodology for solving bi-level quadratic programming (BLQP) problems. In the FGP model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...
متن کاملSensitivity analysis in (degenerate) quadratic programming
In this paper we deal with sensitivity analysis in convex quadratic programming, without making assumptions on nondegeneracy, strict convexity of the objective function, and the existence of a strictly complementary solution. We show that the optimal value as a function of a right{hand side element (or an element of the linear part of the objective) is piecewise quadratic, where the pieces can ...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملApproximation Algorithms for Quadratic Programming
We consider the problem of approximating the global minimum of a general quadratic program (QP) with n variables subject to m ellipsoidal constraints. For m = 1, we rigorously show that an-minimizer, where error 2 (0; 1), can be obtained in polynomial time, meaning that the number of arithmetic operations is a polynomial in n, m, and log(1==). For m 2, we present a polynomial-time (1 ? 1 m 2)-a...
متن کاملquadratic bi-level programming problems: a fuzzy goal programming approach
this paper presents a fuzzy goal programming (fgp) methodology for solving bi-level quadratic programming (blqp) problems. in the fgp model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1976
ISSN: 0022-247X
DOI: 10.1016/0022-247x(76)90157-8