Description: Solve a problem of Linear Program by the Interior Points methods.
Function
[x, Al, Z] = InteriorPoint(c0, x0, A0, b0, alpha, tol)
Inputs
-
c0 -> initial coef. of O.F.
x0 -> initial solution
A0 -> initial constraints
b0 -> limits of constraints
alpha -> adjust
tol -> maximum error
Output
x -> optimal solution
A -> final constrainsts
Z -> optimal value of Objetive Funcion (F.O.)
Creates a text file with every step until the final solution.
To Search:
File list (Check if you may need any files):
InteriorPoint.m
Download