The analytic hierarchy process and multiobjective 0--1 faculty course assignment

DOI10.1016/S0377-2217(03)00189-9zbMath1103.90359OpenAlexW2013645563MaRDI QIDQ1877058

Rafail N. Gasimov, Müjgan Sagir Ozdemir

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00189-9

zbMATH Keywords

Lagrange multiplier ruleAnalytic hierarchy processFaculty-course assignment problemModified subgradient methodZero--one multiple objective programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items (9)

Operational research in education ⋮ A multi-objective programming approach to 1.5-dimensional assortment problem ⋮ A conic scalarization method in multi-objective optimization ⋮ Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods ⋮ Multi-choice goal programming formulation based on the conic scalarizing function ⋮ Integrated analytic hierarchy process and its applications - A literature review ⋮ Combined forecasts in portfolio optimization: a generalized approach ⋮ Existence and characterization theorems in nonconvex vector optimization ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tabu search for large scale timetabling problems
• Proper efficiency with respect to cones
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Benson proper efficiency in the vector optimization of set-valued maps
• A two-stage multiobjective scheduling model for [faculty-course-time assignments]
• A tabu search algorithm for computing an operational timetable
• Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
• A Characterization of Properly Minimal Elements of a Set
• Variational Analysis

This page was built for publication: The analytic hierarchy process and multiobjective 0--1 faculty course assignment