data envelopment analysis (dea) is a technique used to evaluate the relative efficiency of comparable decision making units (dmus) with multiple input-output. it computes a scalar measure of efficiency and discriminates between efficient and inefficient dmus. it can also provide reference units for inefficient dmus without consideration of the decision makers’ (dms) preferences. in this paper, ...

in this paper imprecise target models has been proposed to investigate the relation between imprecise data envelopment analysis (idea) and mini-max reference point formulations. through these models, the decision makers' preferences are involved in interactive trade-off analysis procedures in multiple objective linear programming with imprecise data. in addition, the gradient projection type me...

In this paper we deal with the parallel approximabil-ity of a special class of Quadratic Programming (QP), called Smooth Positive Quadratic Programming. This subclass of QP is obtained by imposing restrictions on the coeecients of the QP instance. The Smoothness condition restricts the magnitudes of the coeecients while the positiveness requires that all the coeecients be non-negative. Interest...

A linearization technique is developed for multi-objective multi-quadratic 0-1 programming problems with linear and quadratic constraints to reduce it to multi-objective linear mixed 0-1 programming problems. The method proposed in this paper needs only O (kn) additional continuous variables where k is the number of quadratic constraints and n is the number of initial 0-1 variables.

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 ...

Abstract: Dynamic programming problem for fractional discrete-time systems with quadratic performance index has been formulated and solved. A new method for numerical computation of optimal dynamic programming problem has been presented. The efficiency of the method has been demonstrated on numerical example and illustrated by graphs. Graphs also show the differences between the fractional and ...