A method for finding the set of non-dominated vectors for multiple objective integer linear programs

Article Abstract:

Multiple Objective Integer Linear Programming (MOILP) happens in Multiple Criteria Decision Making (MCDM) problems that involve discrete decisions. Klein and Hannan's approach solved a sequence of progressively more constrained Integer Linear Programming (ILP) problems. An alternative method, to Klein-Hannan approach, that generates all non-dominated vectors of MOILP presents efficient solutions of each ILP and can be used as a design for interactive Decision Making procedures.

Usage, Integer programming

---

Multicriteria scheduling

Article Abstract:

The review of the most important results obtained in the field of multicriteria scheduling is presented. The basic concept of scheduling, in both general and bi-criteria, and earliness-tardiness scheduling are highlighted. The concepts are explained by solving two example problems.

---

Similar abstracts:

• Abstracts: A heuristic for finding embedded network structure in mathematical programmes. The concave cost supply problem
• Abstracts: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem. A note of the approximation of the asymmetric traveling salesman problem
• Abstracts: A model for multiple brand choice. Simultaneous price and due date settings for multiple customer classes
• Abstracts: Phased multicriteria preference finding. INSDECMuan interactive procedure for stochastic multicriteria decision problems
• Abstracts: A probabilistic interpretation of the final rankings in AHP. Preference and veto thresholds in multicriteria analysis based on stochastic dominance

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