Solving Nonlinear Programming Problems by Linear Approximations

Authors:
Codruţa Chiş, F. Creţ
Abstract:
By dividing the domain of a function into smaller intervals, one can find linear approximations of the function. It was used these to linearize a particular type of nonlinear programming problems, in order to use a modified simplex algorithm to give an approximate solution of such problems.
Location
300645-Timisoara, Calea Aradului 119, Romania
Phone
Tel: +40-256-277423
Fax: +40-256-277326
E-mail
japt@usvt.ro
Copyright © 2025 Journal of Agroalimentary Processes and Technologies