Steepest ascent algorithms for nonconical multiple objective programming
From MaRDI portal
Publication:795749
DOI10.1016/0022-247X(84)90075-1zbMath0542.90094MaRDI QIDQ795749
Gordon B. Hazen, Thomas L. Morin
Publication date: 1984
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
vector optimizationcontinuous variable unconstrained nonconical multiple objective programmingsteepest ascent algorithms
Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)
Related Items (2)
Pruning of decision alternatives in multiple criteria decision making, based on the UTA method for estimating utilities ⋮ Solving a linear multiperiod portfolio problem by interior-point methodology
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions in nonconical multiple objective programming
- Stability of nondominated solutions in multicriteria decision-making
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Preference Convex Unanimity in Multiple Criteria Decision Making
- Interactive Identification and Optimization Using a Binary Preference Relation
- Convergence Conditions for Nonlinear Programming Algorithms
This page was built for publication: Steepest ascent algorithms for nonconical multiple objective programming