Using DEA to obtain efficient solutions for multi-objective 0-1 linear programs

Article Abstract:

Research is presented concerning the use of Data Envelopment Analysis to measure the efficiency of Decision Making Units (DMU) in a service-oriented public sector organization. The use of algorithms for DMU evaluation is discussed.

Data envelopment analysis

---

Algorithms for network piecewise-linear programs: a comparative study

Article Abstract:

Computational experiments were performed to evaluate the relative efficiency of several algorithms for solving network piecewise-linear programming problems with respect to microprocessor time. They are the primal simplex, dual method, out-of-kilter and cost-scaling procedures. After factoring in the type, size, extend of capacitation and number of breakpoints per arc, the results showed the primal method to be the fastest.

Evaluation, Computational complexity, Computational complexity (Machine theory)

---

A reduction algorithm for integer multiple objective linear programs

Article Abstract:

A reduction algorithm was constructed for developing efficient solutions for an integer multiple objective linear program. The reduction algorithm was utilized for the arrangement of efficient solutions for the linear program in a lexicographic order that was derived from the different objective functions of the linear program. The resulting lexicographic order also preserved a new objective function for generating solutions that were not found by the conventional parameter optimization.

Operations research, Methods, Management science, Differential equations, Linear, Linear differential equations

Similar abstracts:

• Abstracts: Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in farming system design

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