Principal direction search: A new method of search for unconstrained LP formulations (Q1058964): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: John Karkazis / rank
Normal rank
 
Property / author
 
Property / author: John Karkazis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(85)90008-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062742850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multi-Commodity Facilities Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:51, 14 June 2024

scientific article
Language Label Description Also known as
English
Principal direction search: A new method of search for unconstrained LP formulations
scientific article

    Statements

    Principal direction search: A new method of search for unconstrained LP formulations (English)
    0 references
    1985
    0 references
    We establish a theoretical background that allows constrained LP formulations of some well-known minimum location problems to be transformed to equivalent unconstrained ones. Based on these unconstrained formulations a new and very promising method of search for optimal solutions, is theoretically established and algorithmically developed. Numerical experience is reported.
    0 references
    Lagrange multipliers
    0 references
    principal direction search
    0 references
    equivalent unconstrained formulation
    0 references
    minimum location
    0 references
    Numerical experience
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references