[图书][B] Vector optimization

J Jahn - 2009 - Springer
The continuous and increasing interest concerning vector optimization perceptible in the
research community, where contributions dealing with the theory of duality abound lately …

[图书][B] Vector optimization with infimum and supremum

A Löhne - 2011 - books.google.com
The theory of Vector Optimization is developed by a systematic usage of infimum and
supremum. In order to get existence and appropriate properties of the infimum, the image …

Solving the fully fuzzy multi-objective transportation problem based on the common set of weights in DEA

M Bagheri, A Ebrahimnejad… - Journal of Intelligent …, 2020 - content.iospress.com
A transportation problem basically deals with the problem which aims to minimize the total
transportation cost or maximize the total transportation profit of distributing a product from a …

Continuous multiobjective programming

MM Wiecek, M Ehrgott, A Engau - … criteria decision analysis: State of the …, 2016 - Springer
We present our view of the state of the art in continuous multiobjective programming. After
an introduction we formulate the multiobjective program (MOP) and define the most …

Finding non dominated points for multiobjective integer convex programs with linear constraints

L Zerfa, MEA Chergui - Journal of Global Optimization, 2022 - Springer
In this paper, we present a branch-and-bound based algorithm to generate all non
dominated points for a multiobjective integer programming problem with convex objective …

The traffic police location and schedule assignment problem

N Adler, AS Hakkert, T Raviv… - Journal of Multi‐Criteria …, 2014 - Wiley Online Library
The traffic police routine patrol vehicle mission is to provide service to the public, primarily
through enforcement of traffic laws and assistance to road users after accidents or other calls …

[PDF][PDF] Determining efficient solutions to multiple objective linear programming problems

P Pandian, M Jayalakshmi - Applied Mathematical Sciences, 2013 - m-hikari.com
A new posteriori method namely, moving optimal method is proposed for solving multiple
objective linear programming problems. It provides efficient solution line segments to the …

[HTML][HTML] Adjacency based method for generating maximal efficient faces in multiobjective linear programming

S Krichen, H Masri, A Guitouni - Applied Mathematical Modelling, 2012 - Elsevier
Multiobjective linear optimization problems (MOLPs) arise when several linear objective
functions have to be optimized over a convex polyhedron. In this paper, we propose a new …

[HTML][HTML] Efficient curve fitting: An application of multiobjective programming

L Pourkarimi, MA Yaghoobi, M Mashinchi - Applied mathematical modelling, 2011 - Elsevier
Curve fitting is an interesting and important subject in mathematics and engineering. It has
been studied extensively and a number of approaches, mostly based on polynomials and …

A Comparison of Benson's Outer Approximation Algorithm with an Extended Version of Multiobjective Simplex Algorithm

PB Nyiam, A Salhi - Advances in Operations Research, 2021 - Wiley Online Library
The multiple objective simplex algorithm and its variants work in the decision variable space
to find the set of all efficient extreme points of multiple objective linear programming (MOLP) …