- Arts & Culture 5938
- Business & Economics 689
- Computers 310
- Dictionaries & Encyclopedias 81
- Education & Science 75858
- Abstracts 252
- Astrology 4
- Astronomy 1
- Biology 8
- Chemistry 2221
- Coursework 15546
- Culture 9
- Diplomas 411
- Drawings 574
- Ecology 5
- Economy 83
- English 75
- Ethics, Aesthetics 3
- For Education Students 17607
- Foreign Languages 11
- Geography 2
- Geology 1
- History 89
- Maps & Atlases 5
- Mathematics 13856
- Musical Literature 2
- Pedagogics 19
- Philosophy 23
- Physics 14841
- Political Science 5
- Practical Work 101
- Psychology 60
- Religion 4
- Russian and culture of speech 8
- School Textbooks 7
- Sexology 42
- Sociology 9
- Summaries, Cribs 87
- Test Answers 150
- Tests 9243
- Textbooks for Colleges and Universities 32
- Theses 24
- To Help Graduate Students 14
- To Help the Entrant 37
- Vetting 364
- Works 13
- Информатика 10
- Engineering 3058
- Fiction 696
- House, Family & Entertainment 107
- Law 132
- Website Promotion 71
Linear programming, option 4, Mesi (task №2)
Uploaded: 18.08.2013
Content: 30818204414470.rar 46,54 kB
Product description
Individual task number 2
Control tasks №1
Solving linear programming simplex method.
The condition task.
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
Control task №2
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:
Additional information
The exact formulation of the tasks you can see in the attached image
Feedback
0Period | |||
1 month | 3 months | 12 months | |
0 | 0 | 0 | |
0 | 0 | 0 |