Math Problem Statement
Kerjakan di Rumah ▸ Seorang pedagang mempunyai Gudang yang hanya dapat mengakses 90 peti barang. Setiap peti barang A dibeli dengan harga Rp. 200.000-dan akan dijual dengan laba Rp.40.000,-. Setiap peti barang B dibeli dengan harga Rp. 100.000,- akan dijual dengan laba Rp. 15.000. Jika modalnya Rp. 13.000.000, maka optimumkan labanyal
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Linear Programming
Optimization
Inequalities
Formulas
x + y ≤ 90 (Storage Capacity Constraint)
200000x + 100000y ≤ 13000000 (Capital Constraint)
Z = 40000x + 15000y (Profit Maximization Function)
Theorems
Simplex Method (for solving linear programming problems)
Suitable Grade Level
Grades 10-12
Related Recommendation
Maximizing Profit with Budget Constraints for PCs and Laptops
Linear Programming Optimization for Maximizing Shoe Store Profit
Maximizing Airline Profit Using Linear Programming with Capacity Constraints
Linear Programming: Maximizing Profit for Metal Fence Orders
Optimization Problem for Maximum Revenue in Cookie Production