2,013 results
Search Results
2. On multiobjective optimization problems involving higher order strong convexity using directional convexificators
3. Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds
4. Correspondence between a new pair of nondifferentiable mixed dual vector programs and higher-order generalized convexity.
5. A modified Tseng's extragradient method for solving variational inequality problems.
6. On first and second order multiobjective programming with interval-valued objective functions.
7. Approximations of unbounded convex projections and unbounded convex sets
8. Relaxations and duality for multiobjective integer programming
9. A survey on the cold start latency approaches in serverless computing: an optimization-based perspective
10. A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
11. A test instance generator for multiobjective mixed-integer optimization
12. An away-step Frank–Wolfe algorithm for constrained multiobjective optimization
13. A novel approach for modelling strategic alliances and partnerships based on the DEA-R models.
14. Corrigendum to 'Infinite-dimensional vector optimization and a separation theorem'.
15. Approximate Benson properly efficient solutions for set-valued equilibrium problems.
16. New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem
17. Global Approximations of Vector Optimization Problems in Terms of Variational Convergence
18. A Nonmonotone Projected Gradient Method for Multiobjective Problems on Convex Sets
19. Solving integer indefinite quadratic bilevel programs with multiple objectives at the upper level
20. Optimality conditions and duality for multiobjective semi-infinite optimization problems with switching constraints on Hadamard manifolds
21. Optimality conditions and duality analysis via generalized subdifferentials for ϵ-quasi solutions of vector optimization problems
22. Constraint Qualifications for Nonsmooth Multiobjective Programming Problems with Switching Constraints on Hadamard Manifolds
23. Second-order strong optimality and duality for nonsmooth multiobjective fractional programming with constraints
24. A line search technique for a class of multi-objective optimization problems using subgradient
25. A Solver for Multiobjective Mixed-Integer Convex and Nonconvex Optimization
26. Multicriteria Optimization and Decision Making: Principles, Algorithms and Case Studies
27. Solvability of generalized vector bifunction variational inequality problem.
28. Berge equilibria and the equilibria of the altruistic game.
29. A simple empirical inventory model for managing the processed corneal tissue equitably in hospitals with demand differentiation.
30. Semi-infinite interval equilibrium problems: optimality conditions and existence results.
31. Existence of Solutions of Set Quasi-Optimization Problems Involving Minkowski Difference.
32. On vector variational E-inequalities and differentiable vector optimization problem
33. Existence and connectedness of the l-minimal approximate solutions for set optimization problems: an application in generalized multiobjective robustness
34. Scalarization via utility functions in multi-objective optimization
35. Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality.
36. An algorithm to solve multi-objective integer quadratic programming problem.
37. Globally proper efficiency of set optimization problems based on the certainly set less order relation.
38. A memetic procedure for global multi-objective optimization.
39. Fractional variational duality results for higher-order multiobjective problems.
40. Quantifying Outcome Functions of Linear Programs: An Approach Based on Interval-Valued Right-Hand Sides
41. Improvement Sets and Robust Multiobjective Optimization
42. On Constraint Qualifications for Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds
43. Adaptive Improvements of Multi-Objective Branch and Bound
44. Solving set-valued optimization problems using a multiobjective approach.
45. A Perturbation Approach to Vector Optimization Problems: Lagrange and Fenchel–Lagrange Duality
46. New second-order necessary optimality conditions for constrained vector optimization problems.
47. An accelerated proximal gradient method for multiobjective optimization.
48. Pareto epsilon-subdifferential sum rule for set-valued mappings and applications to set optimization.
49. On the strength of Lagrangian duality in multiobjective integer programming
50. The Unbounded Parallel-Batching Bicriteria Scheduling with Two-Component Jobs
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.