Approximation of linear programs by Bregman's DF projections

Article Abstract:

Research is presented concerning the finding of linear programming problem solutions and the extension of Bregman's DF projections. The characteristics of Young programming problems are discussed.

---

On the dual of linear inverse problems

Article Abstract:

Linear inverse problems are studied where a vector with positive components is to be chosen from a feasible set defined by linear constraints. The problem requires the minimization of a certain function which is a measure of distance from a priori guess. An explicit and perfect dual of the resulting programming problem is shown, the corresponding duality theorem and optimality criteria are proven, and an algorithm solution is proposed.

Usage, Duality theory (Mathematics)

---

Solution of a possibilistic multiobjective linear programming problem

Article Abstract:

A study has been conducted to develop a model based on the initial solution and Goal Programming to obtain the values of the decision variables. Findings have revealed the development of a decision vector which allows the approximation of the goal functions with fuzzy coefficients of FP-MOLP to the fuzzy solutions -z specifically obtained for such programs. It has also been revealed that the new fuzzy solution in the set of objectives verifies that each component is a triangular fuzzy number.

Multiple criteria decision making, Models, Set theory, Fuzzy sets, Optimal stopping (Mathematical statistics)

Similar abstracts:

• Abstracts: Using DEA to obtain efficient solutions for multi-objective 0-1 linear programs. Algorithms for network piecewise-linear programs: a comparative study

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.