The objective of a linear programming problem is to maximize 1.50A + 1.50B,subject to 3A + 2B ≤ 600,2A + 4B ≤ 600,1A + 3B ≤ 420,and A,B ≥ 0.
a.Plot the constraints on the grid below
c.Identify the feasible region and its corner points.Show your work.
d.What is the optimal product mix for this problem? 
Definitions:
Burgher
A member of the middle class in medieval towns, typically involved in commerce or trade, having certain rights and privileges.
Countryside
Refers to rural areas characterized by natural landscapes, farming land, and low population density, often contrasted with urbanized regions.
City
A large and permanent human settlement with complex systems for governance, communication, and transportation.
Charters
Legal documents granting rights, privileges, or authority, usually from a monarch or other sovereign authority, to an individual, group, or organization.
Q4: _ are restrictions that limit the degree
Q9: In linear programming,statements such as "the blend
Q12: Wheeled Coach uses _ as the catalyst
Q35: Henry Ford and _ are credited with
Q62: The graphical method of solving linear programs
Q65: The number of tires sold at a
Q85: The objective of maintenance and reliability is
Q97: Expected monetary value is most appropriate for
Q107: The priority rule that appears fair to
Q117: A waiting line has a(n)_ population if,as