ADM307-ARA SINAV Protected View) - Microsoft Word Insert Page Layout References Mailings Review View This file originated from an internet location and might be unsafe. Click for more details. Enable Editing 70 MINUTES EACH QUESTION IS WORTH 20 POINTS L. A COMPANY HAS THREE PRODUCTION PLANTS AND THREE DISTRIBUTION SITES. NUMBERS IN THE MATRIX SHOW TRANSPORTATION COST PER TON OF PRODUCT. THE COMPANY WANTS TO MINIMIZE ITS TOTAL TRANSPORTATION COSTS. FORMULATE PROBLEM AS A LINEAR PROGRAMMING PROBLEM.SET UP THE PROBLEM ONLY SITE A SITE B SITE C CAPACITY(TON) PLANT 1 10 4 11 70 PLANT 2 12 5 8 50 PLANT 3 9 7 6 150 DEMAND(TON) 100 100 70 2.A A COMPUTER COMPANY MAKES 10$ ON EACH MODEL OF A AND 40$ ON EACH MODEL OF B. EACH COMPUTER REQUIRES THE FOLLOWING TIME ON CLEANING AND PRODUCTION AS SHOWN BELOW. A REQUIREMENT B REQUIREMENT TIME AVAILABLE PRODUCTION 2 60 CHATTE w pe here to search