Implementation of successive linear programming algorithms for non-convex goal programming

DOI10.1016/0305-0548(88)90027-5zbMath0628.90047OpenAlexW2082669651MaRDI QIDQ1093528

A. Charnes, Ronald D. Armstrong, Cengiz Haksever

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90027-5

zbMATH Keywords

Charnes and Cooper's linearization methodComputer implementationNegative Image Methodnonlinear, non-convex ratio goals problemOpposite Sign Algorithmsequence of perturbed linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Linear programming (90C05)

Related Items (2)

A Fourth bibliography of fractional programming ⋮ Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure

Cites Work

• Unnamed Item
• Successive linear programming for ratio goal problems
• Goal programming and multiple objective optimizations. Part I
• The Elimination form of the Inverse and its Application to Linear Programming
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• Spike swapping in basis reinversion
• Reinversion with the preassigned pivot procedure

This page was built for publication: Implementation of successive linear programming algorithms for non-convex goal programming