Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
From MaRDI portal
Publication:1169409
DOI10.1016/0377-2217(82)90202-8zbMath0494.90071OpenAlexW1985709216MaRDI QIDQ1169409
Publication date: 1982
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(82)90202-8
Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)
Related Items (40)
Multiobjective mathematical programming via the MULTIPLEX model and algorithm ⋮ Zero-one programming with multiple criteria ⋮ An assessment of some criticisms of goal programming ⋮ Relaxation of constraints in lexicographic multiobjective programming problems ⋮ An iterative algorithm for two level hierarchical time minimization transportation problem ⋮ On single-stage DEA models with weight restrictions ⋮ A dual-based algorithm for solving lexicographic multiple objective programs ⋮ A preference structure on aspiration levels in a goal programming problem - a fuzzy approach ⋮ ILP approaches to the blockmodel problem ⋮ Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation ⋮ A dual strategy for solving the linear programming relaxation of a driver scheduling system ⋮ A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ Bilevel time minimizing assignment problem ⋮ Bounds on penalties for dummy arcs in transportation networks ⋮ An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks ⋮ A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem ⋮ A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem ⋮ Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs ⋮ On the transformation of lexicographic nonlinear multiobjective programs to single objective programs ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ On lexicographic optimal solutions in transportation problems ⋮ On generating maximal nondominated Benders cuts ⋮ Solution of preemptive multi-objective network design problems applying Benders decomposition method ⋮ Planning for a bus-based evacuation ⋮ Computational complexity of convoy movement planning problems ⋮ A quantitative approach for scheduling activities to reduce set-up in multiple machine lines ⋮ A polynomial algorithm for a two-stage time minimizing transportation problem. ⋮ Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations ⋮ Assigning judges to competitions of several rounds using tabu search ⋮ Two level hierarchical time minimizing transportation problem ⋮ CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ Max-min sum minimization transportation problem ⋮ A priority based assignment problem ⋮ Approximate and robust bounded job start scheduling for Royal Mail delivery offices ⋮ A priority based time minimization transportation problem ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ An enhanced conversion scheme for lexicographic, multiobjective integer programs ⋮ Solving some lexicographic multi-objective combinatorial problems ⋮ An alternate approach to solve two-level priority based assignment problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Generating all maximal efficient faces for multiple objective linear programs
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- A versatile scheme for ranking the extreme points of an assignment polytope
- Finding all efficient extreme points for multiple objective linear programs
- Optimal maintenance headcount allocation: an application of Chebyshev Goal Programming
- A revised simplex method for linear multiple objective programs
- Linear programming with multiple objective functions: Step method (stem)
- Extreme Point Mathematical Programming
- Problems and methods with multiple objective functions
- An Algorithm for Solving Multicriterion Linear Programming Problems with Examples
This page was built for publication: Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
