A linear programming problem seeks to maximize profit subject to , , , and . At which corner point is profit maximized?
Answer and explanation
Correct answer: A.
- Step 1: Find the intersection of and . From the first, . Substitute: . Then . Check values: at , ; at , ; at , . The maximum is at . **Answer: . Why not the others:** gives , gives , and gives .
Practise more Commercial Arithmetic, Applied Algebra, Geometry and Statistics.
Free questions with an explanation for every one, and full timed Poklicna matura (Vocational Matura Slovenia) mock tests.
More Commercial Arithmetic, Applied Algebra, Geometry and Statistics questions
- A wholesale product has a base price of before tax. With standard Slovenian VAT at , what is the final gross price?
- A retailer buys an electric drill for and applies a markup of on the cost price. What is the selling price before tax…
- During an autumn sale, a laptop originally priced at is discounted by . What is the discounted sales price?
- A gross invoice including VAT totals . What is the net price of the goods before tax?
- A machine purchased for depreciates by of its value each year under the declining-balance method. What is its book…
- A deposit of is placed in a bank account offering simple annual interest of . How much interest is earned after …