- Arts & Culture 5856
- Business & Economics 679
- Computers 309
- Dictionaries & Encyclopedias 81
- Education & Science 74854
- Abstracts 100
- Astrology 4
- Astronomy 1
- Biology 8
- Chemistry 2047
- Coursework 15184
- Culture 9
- Diplomas 414
- Drawings 817
- Ecology 5
- Economy 84
- English 75
- Ethics, Aesthetics 3
- For Education Students 17548
- Foreign Languages 11
- Geography 2
- Geology 1
- History 89
- Maps & Atlases 4
- Mathematics 13808
- Musical Literature 2
- Pedagogics 19
- Philosophy 23
- Physics 14735
- Political Science 5
- Practical Work 59
- Psychology 60
- Religion 4
- Russian and culture of speech 8
- School Textbooks 7
- Sexology 42
- Sociology 9
- Summaries, Cribs 87
- Test Answers 145
- Tests 8962
- Textbooks for Colleges and Universities 32
- Theses 7
- To Help Graduate Students 13
- To Help the Entrant 37
- Vetting 361
- Works 13
- Информатика 10
- Engineering 3059
- Fiction 696
- House, Family & Entertainment 107
- Law 132
- Website Promotion 71
3 tasks EMM
Uploaded: 23.08.2013
Content: 30823161112657.rar 27,52 kB
Product description
Target 8
Using the graphical method to find a solution to the following linear programming problem:
Problem 30
The table shows the stocks of some cargo from suppliers, the need for this cargo customers and the cost of transportation of goods from each supplier to each consumer:
Suppliers Consumers Stocks
B1 B2 B3
A1 April 9 1 40
A2 1 5 2 40
A3 2 60 August 8
Requirements 30 45 65
Make the optimal transportation plan, such that all the requirements have been met and with the cost of all traffic was the least possible.
Task 52
According to the plan of production of the company needs to make 118 parts. These products can be manufactured by two technological ways. Production costs for the manufacture of «n» first manufacturing method are 2n + n2, and the second method - 14n + n2. How many products have to make in every way to the overall cost of production was minimal?
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 |