Principal direction search: A new method of search for unconstrained LP formulations

DOI10.1016/0377-2217(85)90008-6zbMath0565.90013OpenAlexW2062742850MaRDI QIDQ1058964

John Karkazis

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90008-6

zbMATH Keywords

Lagrange multipliersequivalent unconstrained formulationminimum locationNumerical experienceprincipal direction search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Inventory, storage, reservoirs (90B05)

Related Items (3)

On the exact solution of large-scale simple plant location problems ⋮ Lagrangean heuristics for location problems ⋮ Facilities location in a competitive environment: A Promethee based multiple criteria analysis

Cites Work

• An Automatic Method of Solving Discrete Programming Problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• The Multi-Commodity Facilities Location Problem
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Principal direction search: A new method of search for unconstrained LP formulations