A global optimization method for nonconvex separable programming problems (Q1847169): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Deterministic Inventory System with an Inventory-Level-Dependent Demand Rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inventory models with general backorder costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discharge allocation for hydro-electric generating stations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient method for solving linear goal programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate approach of global optimization for polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Segment Separable Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135820 / rank
 
Normal rank

Latest revision as of 18:37, 4 June 2024

scientific article
Language Label Description Also known as
English
A global optimization method for nonconvex separable programming problems
scientific article

    Statements

    A global optimization method for nonconvex separable programming problems (English)
    0 references
    0 references
    0 references
    17 November 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    goal programming
    0 references
    piecewise linear function
    0 references
    separable programming
    0 references