An interval programming algorithm for discrete linear L1 approximation problems
نویسندگان
چکیده
منابع مشابه
An Algorithm for Solving Interval Linear Programming Problems
This paper presents en algorithm for solving interval linear programming problems. The algorithm is a finite iterative method, which in each iteration solves a full row rank interval linear progranming problem, with only one additional constraint. The solution and/or problem chosen appears to be conputationally more efficient than that in the Ben-Israel and Robers algorithm.
متن کاملAn Exponential Approximation Algorithm in Linear Programming
The algorithm determines a non-iteration procedure for computing the optimal solution of a linear programming problem. We consider approximating system of linear equations to determine the optimal basis variables of the linear programming problem. The usefulness of the algorithm is illustrated by a numerical example. © 2014 The Authors. Published by Elsevier B.V. Selection and peer-review under...
متن کاملDuality Theory for Interval Linear Programming Problems
We define the primal and dual linear programming problems involving interval numbers as the way of traditional linear programming problems. We discuss the solution concepts of primal and dual linear programming problems involving interval numbers without converting them to classical linear programming problems. By introducing new arithmetic operations between interval numbers, we prove the weak...
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملAn approximation algorithm for convex multi-objective programming problems
In multi-objective convex optimization it is necessary to compute an infinite set of nondominated points. We propose a method for approximating the nondominated set of a multi-objective nonlinear programming problem, where the objective functions and the feasible set are convex. This method is an extension of Benson’s outer approximation algorithm for multi-objective linear programming problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1969
ISSN: 0021-9045
DOI: 10.1016/0021-9045(69)90001-x