A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
DOI10.1016/J.EJOR.2015.06.016zbMATH Open1346.90750OpenAlexW656398941MaRDI QIDQ319989FDOQ319989
Ying Ji, Mark Goh, Robert De Souza, Shaojian Qu
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.016
Recommendations
- Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
- A new Lagrangian-Benders approach for a concave cost supply chain network design problem
- Discrete Convex Optimization and Applications in Supply Chain Management
- A possibilistic linear programming model for supply chain network design under uncertainty
- Robust bi-level optimization for an opportunistic supply chain network design problem in an uncertain and risky environment
- Possibilistic linear-programming approach for supply chain networking decisions
- Stochastic variational inequality problems with additional constraints and their applications in supply chain network equilibria
- A stochastic programming approach for supply chain network design under uncertainty
- A probabilistic bi-level linear multi-objective programming problem to supply chain planning
multiple objective programmingproximal point algorithm\(C\)-convexPareto optimumsupply chain network risk management
Convex programming (90C25) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)
Cites Work
- Complementarity problems in GAMS and the PATH solver
- Multiplier and gradient methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria optimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Title not available (Why is that?)
- Proximité et dualité dans un espace hilbertien
- Title not available (Why is that?)
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Convex vector functions and their subdifferential
- Proximal Methods in Vector Optimization
- An interior proximal method in vector optimization
- A proximal point-type method for multicriteria optimization
- A Subgradient Method for Vector Optimization Problems
- Multi-criteria decision analysis via ratio and difference judgement
- Scalarization of vector optimization problems
- Nonsmooth multiobjective programming with quasi-Newton methods
- Scalarization in vector optimization
- Lagrangian-Dual Functions and Moreau–Yosida Regularization
- Quasi-Newton methods for solving multiobjective optimization
- Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Some Remarks on Bi-level Vector Extremum Problems
- Stochastic optimization problems with CVaR risk measure and their sample average approximation
Cited In (5)
- An accelerated augmented Lagrangian method for multi-criteria optimization problem
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management
- A relaxed projection method for solving multiobjective optimization problems
- Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
Uses Software
This page was built for publication: A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319989)
