Mat 540 week 11 final exam

1. Which of the next might be a linear programming goal operate?

 

2. Which of the next couldn’t be a linear programming drawback constraint?

 

three. Forms of integer programming fashions are _____________

 

four. The manufacturing supervisor for Beer and so on. produces 2 sorts of beer: mild (L) and darkish (D). Two sources used to supply beer are malt and wheat. He can receive at most 4800 ouncesof malt per week and at most 3200 ouncesof wheat per week respectively. Every bottle of sunshine beer requires 12 ouncesof malt and four ouncesof wheat, whereas a bottle of darkish beer makes use of eight ouncesof malt and eight ouncesof wheat.

Earnings for mild beer are $2 per bottle, and income for darkish beer are $1 per bottle. If the manufacturing supervisor decides to supply of zero bottles of sunshine beer and 400 bottles of darkish beer, it should lead to slack of

 

5. The decreased value (shadow worth) for a constructive determination variable is zero

TRUE/FALSE

 

6. Determination variables

 

 7. A plant supervisor is trying to find out the manufacturing schedule of varied merchandise to maximise revenue. Assume that a machine hour constraint is binding. If the unique quantity of machine hours out there is 200 minutes., and the vary of feasibility is from 130 minutes to 340 minutes, offering two extra machine hours will end result within the

 

eight. Determination fashions are mathematical symbols representing ranges of exercise.

TRUE/FALSE

 

9. The integer programming mannequin for a transportation drawback has constraints for provide at every supply and demand at every vacation spot.

TRUE/FALSE

 

10. In a transportation drawback, gadgets are allotted from sources to locations

 

11. In a media choice drawback, the estimated variety of clients reached by a given media would typically be specified within the _________________. Even when these media publicity estimates are appropriate, utilizing media publicity as a surrogate doesn’t result in maximization of ___.

 

12. ____________ options are ones that fulfill all of the constraints concurrently.

 

13. In a linear programming drawback, a sound goal operate may be represented as

 

14. The usual type for the pc answer of a linear programming drawback requires all variables to the best and all numerical values to the left of the inequality or equality signal

TRUE/FALSE

 

15. Constraints representing fractional relationships such because the manufacturing amount of product 1 should be a minimum of twice as a lot because the manufacturing amount of merchandise 2, three and four mixed can’t be enter into laptop software program packages as a result of the left aspect of the inequality doesn’t include consists of pure numbers.

TRUE/FALSE

 

16. In a balanced transportation mannequin the place provide equals demand

 

17. The target operate is a linear relationship reflecting the target of an operation.

TRUE/FALSE

 

18. The proprietor of Chips and so on. produces 2 sorts of chips: Lime (L) and Vinegar (V). He has a restricted quantity of the three elements used to supply these chips out there for his subsequent manufacturing run: 4800 ounces of salt, 9600 ounces of flour, and 2000 ounces of herbs. A bag of Lime chips requires 2 ounces of salt, 6 ounces of flour, and 1 ounce of herbs to supply; whereas a bag of Vinegar chips requires three ounces of salt, eight ounces of flour, and a couple of ounces of herbs. Earnings for a bag of Lime chips are $zero.40, and for a bag of Vinegar chips $zero.50. Which of the next just isn’t a possible manufacturing mixture?

 

19. The linear programming mannequin for a transportation drawback has constraints for provide at every supply and demand at every vacation spot.

TRUE/FALSE

 

 20. For a maximization drawback, assume that a constraint is binding. If the unique quantity of a useful resource is four lbs., and the vary of feasibility (sensitivity vary) for this constraint is from

 three lbs. to six lbs., rising the quantity of this useful resource by 1 lb. will end result within the

 

21. In a complete integer mannequin, all determination variables have integer answer values.

TRUE/FALSE

 

23. Linear programming is a mannequin consisting of linear relationships representing a agency’s selections given an goal and useful resource constraints.

TRUE/FALSE

 

24. When utilizing linear programming mannequin to resolve the “weight loss plan” drawback, the target is mostly to maximise revenue.

TRUE/FALSE

 

25. In a balanced transportation mannequin the place provide equals demand, all constraints are equalities.

TRUE/FALSE

 

26. In a transportation drawback, gadgets are allotted from sources to locations at a minimal value.

TRUE/FALSE

 

27. Mallory Furnishings buys 2 merchandise for resale: large cabinets (B) and medium cabinets (M). Every large shelf prices $500 and requires 100 cubic toes of space for storing, and every medium shelf prices $300 and requires 90 cubic toes of space for storing. The corporate has $75000 to spend money on cabinets this week, and the warehouse has 18000 cubic toes out there for storage. Revenue for every large shelf is $300 and for every medium shelf is $150.  Which of the next just isn’t a possible buy mixture?

 

28. In a combined integer mannequin, some answer values for determination variables are integer and others may be non-integer.

TRUE/FALSE

 

29. In a zero – 1 integer mannequin, the answer values of the choice variables are zero or 1.

TRUE/FALSE

 

30. Figuring out the manufacturing portions of various merchandise manufactured by an organization primarily based on useful resource constraints is a product combine linear programming drawback.

TRUE/FALSE

 

31. When the right-hand sides of two constraints are each elevated by 1 unit, the worth of the target operate shall be adjusted by the sum of the constraints’ costs.

TRUE/FALSE

 

32. The transportation methodology assumes that

 

33. A constraint is a linear relationship representing a restriction on determination making.

TRUE/FALSE

 

34. When formulating a linear programming mannequin on a spreadsheet, the measure of efficiency is positioned within the goal cell.

TRUE/FALSE

 

35. The linear programming mannequin for a transportation drawback has constraints for provide at every ________ and _________ at every vacation spot.

 

 

36. The three kinds of integer programming fashions are whole, zero – 1, and combined.

TRUE/FALSE

 

37. In utilizing rounding of a linear programming mannequin to acquire an integer answer, the answer is

 

 

38. If we use Excel to resolve a linear programming drawback as a substitute of QM for Home windows,

 then the information enter necessities are prone to be a lot much less tedious and time consuming.

TRUE/FALSE

 

39. In a _______ integer mannequin, some answer values for determination variables are integer and others may be non-integer.

 

40. Which of the next just isn’t an integer linear programming drawback?