 # Linear programming, option 4, Mesi (task №2)

Sold: 0
Content: 30818204414470.rar 46,54 kB

## Seller ОРИГИНАЛ information about the seller and his items

## Description

Solving linear programming simplex method.
The company produces three types of products: A1, A2, A3, using raw materials of two types: B1 and B2. Known costs i - th species per unit of product g - th species aig, quantities of raw materials of each kind bi (i = 1,2), as well as the income derived from the product units g-th species cg (g = 1,2,3 ).
1) How many of each type of product you need to make in order to get the maximum profit?
2) How many of each type of product you need to make in order to get the most marketable products?
3) How many of each type of product you need to make in order to get the maximum profit, provided the company pays for raw material storage units B1 and B2, respectively, 0.1 and 0.3 of the monetary unit?
Matrix raw material costs the i - th species per unit of output g - of the type A = (aig)
Raw materials
Other products of the raw material
A1 A2 A3
B1 2 April 1, 1600
B2 2 March 1, 1800
Profit from the unit of each product (c1, c2, c3) 2 1 3

Solving linear programming dual simplex method (P - method).
The dual simplex method, as well as the simplex method is used in finding the solution of linear programming problem, written in the form of the basic problem.
However, the dual simplex method can be used in solving linear programming problems, the constant terms of the system of equations which can be any numbers (in solving the problem of the simplex method, these supposed non-negative).

with the following restrictions:
with the following restrictions: 