A simple SLP algorithm for solving a class of nonlinear programs

DOI10.1016/0377-2217(95)00127-1zbMath0916.90247OpenAlexW2094338292MaRDI QIDQ1278946

Eldon A. Gunn, Ruhul A. Sarker

Publication date: 28 February 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00127-1

zbMATH Keywords

successive linear programmingmultiperiod coal blending

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Related Items (6)

Strong formulations for the pooling problem ⋮ A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines ⋮ A cost minimization heuristic for the pooling problem ⋮ Feasibility and cost minimisation for a lithium extraction problem ⋮ Alternative Mathematical Programming Models: A Case for a Coal Blending Decision Process ⋮ Using Column Generation to Solve a Coal Blending Problem

Uses Software

• XMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the solution of bilinear programming problems by reduction to concave minimization
• Spectral localization of operators in Banach spaces
• A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
• An Improved Successive Linear Programming Algorithm
• Successive Linear Programming at Exxon
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Feature Article—Survey of Nonlinear Programming Applications
• The bilinear programming problem
• Bilinear programming: An exact algorithm
• A cutting plane algorithm for the bilinear programming problem
• Nonlinear Optimization by Successive Linear Programming

This page was built for publication: A simple SLP algorithm for solving a class of nonlinear programs