A branch and bound algorithm for mixed zero-one multiple objective linear programming

Article Abstract:

The design of a mixed 0-1 multiple objective linear programming model is presented which surmounts the limitations of linear programs on problems with multiple objectives. The algorithm is sensitized to the multiple objective consideration through a node fathoming procedure. An interactive procedure is likewise added which filters the number of efficient points for consideration without any attending loss of essential information.

Operations Research, Management science, Decision-making, Decision making, Software, Simulation methods, Simulation

---

Project prioritization under policy restrictions. a combination of MCDA with 0u1 programming

Article Abstract:

The process of using multiple criteria decision aid concepts in financial decision making and project prioritization in operations management is discussed.

Financial Systems & Controls, Financial Management, Multiple criteria decision making, Europe

---

About the applicability of MCDA to some robustness problems

Article Abstract:

The implementation of multi-criteria decision analysis in addressing some tough problems in production management is presented.

Usage, Decision analysis

Similar abstracts:

• Abstracts: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. On the Coleman indices of voting power
• Abstracts: A hybrid metaheuristic for the resource-constrained project scheduling problem. Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
• Abstracts: Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings. Inventory rationing via drop-shipping in Internet retailing: a sensitivity analysis
• Abstracts: On the Coleman indices of voting power. Dynamic pricing with real-time demand learning. Nodal aggregation of resource constraints in a shortest path problem

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