Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Ta Van Tu
Institution:
Corvinus University of Budapest
Observed institutions:
Budapest University of Economics and Business,
Corvinus University of Budapest
ORCID:
0000-0002-9039-5362
Observed ORCID:
0000-0002-9039-5362
OpenAlex ID:
A5089945809
Optimization over the efficient set of a parametric multiple objective linear programming problem
2000
·
Ta Van Tu
·
European Journal of Operational Research
·
19
A New Method for Determining all Maximal Efficient Faces in Multiple Objective Linear Programming
2016
·
Ta Van Tu
·
Acta Mathematica Vietnamica
·
7
A common formula to compute the efficient sets of a class of multiple objective linear programming problems
2014
·
Ta Van Tu
·
Optimization
·
7
The maximal descriptor index set for a face of a convex polyhedral set and some applications
2015
·
Ta Van Tu
·
Journal of Mathematical Analysis and Applications
·
6
PDF
A combined top-down and bottom-up search method for determining all maximal efficient faces in multiple objective linear programming
2023
·
Ta Van Tu
·
Research Square
·
4
PDF
Minimal Representations of a Face of a Convex Polyhedron and Some Applications
2021
·
Ta Van Tu
·
Acta Mathematica Vietnamica
·
3
PDF
Finding All Efficient Solutions of an Interval Multiple Objective Linear Programming Problem
2024
·
Ta Van Tu
·
Preprints.org
·
1
PDF
On generalized linear multiple objective programming
1996
·
Ta Van Tu
·
Pure mathematics and applications
·
1
A Method to Find All Efficient Solutions of an Interval Multiple Objective Linear Programming Problem
2026
·
Ta Van Tu
·
Operations Research Forum
Finding All Possibly Efficient Solutions of an Interval Multiple Objective Linear Programming Problem
2025
·
Ta Van Tu
·
Preprints.org
PDF
Finding All Efficient Solutions of an Interval Multiple Objective Linear Programming Problem
2024
·
Ta Van Tu
·
Preprints.org
Về một lớp mô hình tối ưu và ứng dụng
2018
·
Ta Van Tu
·
Journal of Computer Science and Cybernetics
PDF
Show more works
View as search
Works count:
12
Citation count:
48
H-index:
4
I10-index:
1
Year
Topic
Type