Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
A. Maximization Problem. Niki holds two part-time jobs, Job I and Job II. She never wants to work more than a total of 12 hours a week. She has determined that for every hour she works at Job I, she needs 2 hours of preparation time, and for every hour she works at Job II, she needs one hour of preparation time, and she cannot spend more than 16 hours for preparation. If Nikki makes P40 an hour at Job I, and P30 an hour at Job II, how many hours should she work per week at each job to maximize her income? Let x = The number of hours per week Niki will work at Job I.

A. Maximization Problem. Niki holds two part-time jobs, Job I and Job II. She never wants to work more than a total of 12 hours a week. She has determined that for every hour she works at Job I, she needs 2 hours of preparation time, and for every hour she works at Job II, she needs one hour of preparation time, and she cannot spend more than 16 hours for preparation. If Nikki makes P40 an hour at Job I, and P30 an hour at Job II, how many hours should she work per week at each job to maximize her income? Let x = The number of hours per week Niki will work at Job I.

College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter6: Linear Systems
Section6.8: Linear Programming
Problem 3SC: In Example 3, if the accountant earns a profit of 100 on each individual return and a profit of 175...
See similar textbooks
icon
Related questions
Question
Huhuhuu solve for me all plz .....
Notes on LP problems. 1. The objective function is to be maximized OR minimized. 2. All constraints are of the form ax + by ≤ c for maximization and ax+by > c for minimization. 3. All variables are constrained to by non-negative ( x ≥ 0, y ≥ 0). A. Maximization Problem. Niki holds two part-time jobs, Job I and Job II. She never wants to work more than a total of 12 hours a week. She has determined that for every hour she works at Job I, she needs 2 hours of preparation time, and for every hour she works at Job II, she needs one hour of preparation time, and she cannot spend more than 16 hours for preparation. If Nikki makes P40 an hour at Job I, and P30 an hour at Job II, how many hours should she work per week at each job to maximize her income? Let x = The number of hours per week Niki will work at Job I.
Transcribed Image Text:Notes on LP problems. 1. The objective function is to be maximized OR minimized. 2. All constraints are of the form ax + by ≤ c for maximization and ax+by > c for minimization. 3. All variables are constrained to by non-negative ( x ≥ 0, y ≥ 0). A. Maximization Problem. Niki holds two part-time jobs, Job I and Job II. She never wants to work more than a total of 12 hours a week. She has determined that for every hour she works at Job I, she needs 2 hours of preparation time, and for every hour she works at Job II, she needs one hour of preparation time, and she cannot spend more than 16 hours for preparation. If Nikki makes P40 an hour at Job I, and P30 an hour at Job II, how many hours should she work per week at each job to maximize her income? Let x = The number of hours per week Niki will work at Job I.
Let x = The number of hours per week Niki will work at Job I. Let y = The number of hours per week Niki will work at Job II. Preparation time Working hours a week Hourly rate X 2 1 40 Y 1 1 30 total hours 16 12 A.1. Translate the above matrix into a linear programming model (LP Model). Define the objective function and the constraints (structural and non- negativity). A.2. Using DESMOS, graph the constraints and take a screenshot of the feasible region or use Snipping tool. A.3. Determine the optimal solution and the optimal value of her income. A.4. Interpret the results in A.3 to answer the question.
Transcribed Image Text:Let x = The number of hours per week Niki will work at Job I. Let y = The number of hours per week Niki will work at Job II. Preparation time Working hours a week Hourly rate X 2 1 40 Y 1 1 30 total hours 16 12 A.1. Translate the above matrix into a linear programming model (LP Model). Define the objective function and the constraints (structural and non- negativity). A.2. Using DESMOS, graph the constraints and take a screenshot of the feasible region or use Snipping tool. A.3. Determine the optimal solution and the optimal value of her income. A.4. Interpret the results in A.3 to answer the question.
Expert Solution
steps

Step by step

Solved in 5 steps with 6 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Algebra for College Students
Algebra for College Students
Algebra
ISBN:
9781285195780
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning
Elementary Linear Algebra (MindTap Course List)
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:
9781305658004
Author:
Ron Larson
Publisher:
Cengage Learning
Glencoe Algebra 1, Student Edition, 9780079039897…
Glencoe Algebra 1, Student Edition, 9780079039897…
Algebra
ISBN:
9780079039897
Author:
Carter
Publisher:
McGraw Hill
SEE MORE TEXTBOOKS