Recently, fuzzy linear programming problems have been considered by many. In the literature of fuzzy linear programming several models are offered and therefore some various methods have been suggested to solve these problems. One of the most important of these problems that recently has been considered; are Fully Fuzzy Linear Programming (FFLP), which all coefficients and variables of the prob...

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

This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...

In this paper we study the problem of model selection for a linear programming-based support vector machine for regression. We propose generalized method that is based on a quasi-Newton method that uses a globalization strategy and an inexact computation of first order information. We explore the case of two-class, multi-class, and regression problems. Simulation results among standard datasets...

The article presents a new scalable iterative method for linear programming called the “apex method”. key feature of this is constructing path close to optimal on surface feasible region from certain starting point exact solution problem. refers minimum length according Euclidean metric. apex based predictor—corrector framework and proceeds in two stages: quest (predictor) target (corrector). s...

In this paper, we will show that the width of simplices defined by systems of linear inequalities can be computed in polynomial time if some minors of their constraint matrices are bounded. Additionally, we present some quasi-polynomial-time and polynomial-time algorithms to solve the integer linear optimization problem defined on simplices minus all their integer vertices assuming that some mi...

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