%File name> linear_programming.m
%linear programming - Simplex method
% Prof. Reyolando Brasil - May 2021
%
%toy factory maximum profit
%
%main program
%design variables
%x1=number of type A toy sold
%x2=number of type B toy sold
%
clear
clc
%
a=[1 1 1 0 0;1/28 1/14 0 1 0;1/14 1/24 0 0 1]; %constraint equations
b=[16 1 1]; % resources vector
c=[-400 -600 0 0 0]; %objective function
%
%
[X,FVAL,EXITFLAG,OUTPUT]=linprog(c,[],[],a,b,zeros(size(c)),[],[])
%