Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems
From MaRDI portal
Publication:1867097
DOI10.1016/S0305-0548(01)00070-3zbMath1010.90072OpenAlexW2005824503MaRDI QIDQ1867097
Jumah E. Al-alwani, Behnam B. Malakooti
Publication date: 2 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00070-3
multiple criteria decision makingutility functionsnonlinear multi-objective optimizationquasi-convexpaired comparisonextremist decision behavior
Related Items
Integrated group technology, cell formation, process planning, and production planning with application to the emergency room ⋮ A triangular type-2 multi-objective linear programming model and a solution strategy ⋮ Multi-objective OLSR for proactive routing in MANET with delay, energy, and link lifetime predictions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
- Approximating polynomial functions by feedforward artificial neural networks: Capacity analysis and design
- Multiobjective programming and planning
- Linear multiobjective programming
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Generalized polynomial decomposable multiple attribute utility functions for ranking and rating multiple criteria discrete alternatives.
- An improved method for solving multiple criteria problems involving discrete alternatives
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- Generalized concavity of a function in portfolio theory
- Methods for Global Concave Minimization: A Bibliographic Survey
- Concave Minimization Via Collapsing Polytopes
- An exact interactive method for exploring the efficient facets of multiple objective linear programming problems with quasi-concave utility functions
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- Use of Convex Cones in Interactive Multiple Objective Decision Making
- Aspiration-Based Search Algorithm (ABSALG) for Multiple Objective Linear Programming Problems: Theory and Comparative Tests
- Feedforward Artificial Neural Networks for Solving Discrete Multiple Criteria Decision Making Problems
- Interactive Approaches for Discrete Alternative Multiple Criteria Decision Making with Monotone Utility Functions
- Linear programming with multiple objective functions: Step method (stem)
