Steepest ascent algorithms for nonconical multiple objective programming (Q795749): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Preference Convex Unanimity in Multiple Criteria Decision Making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions in nonconical multiple objective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Conditions for Nonlinear Programming Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of nondominated solutions in multicriteria decision-making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Identification and Optimization Using a Binary Preference Relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588318 / rank
 
Normal rank

Latest revision as of 12:18, 14 June 2024

scientific article
In more languages
Configure
Language Label Description Also known as
English
Steepest ascent algorithms for nonconical multiple objective programming
scientific article

    Statements

    Identifiers