Please enable JavaScript.
Coggle requires JavaScript to display documents.
CONVEX NON-LINEAR PROGRAMMING (Methods (Gradient Method (solves (Problems…
CONVEX NON-LINEAR PROGRAMMING
Methods
Approach sequential
consists
Substitution
using
Aproximations
solving
Linear Methods
Frank and Wolfe
consist in
Find Solution Feasible
through
Approach Linear
Gradient Method
solves
Problems without Restrictions
Steps
x=x(0), k=0
Choose dk
Do search linear ak
x(k+1) = x + ak * dk
Test of convergence x(k+1)
Converge
1 more item...
No Converge
1 more item...
Consist in
Function
Objective
must be
Non - Linear
where
Convex
Minimize
Concave
Maximize
as
Quadratic
Separable
with
Restrictions
Characterized by
Own or Not
Restrictions
it has
Must be Convex
is unrestricted
Must be Linear
Aplications
Design of
Transportation Networks
Production and
Addressing Network
Production in
Factories
Software
MOSEK
Mathematical Programming
Language (MPL)
