Consider the Following Linear Programming Problem Reformulate and Solve This Problem as a Goal Programming Problem

question 4

Essay

Consider the following linear programming problem:
$$\begin{array} { l } \text { Max: } 500 A + 700 B \\\text { Subject to: } \\2 A + 3 B \leq 35 \text { (assembly hours) } \\3 A + 5 B \leq 40 \text { (machine hours) }\end{array}$$
Reformulate and solve this problem as a goal programming problem if the following prioritized goals must be met.

---

Definitions:

Absolute Advantage

Absolute advantage refers to the ability of a country, company, or individual to produce a good or service more efficiently than competitors, using the same amount of resources.

Trade

The trading of goods, services, or a combination of both among two or more entities, domestically or across borders.

Comparative Advantage

The capability of a person, business, or nation to manufacture a product or provide a service with a smaller opportunity cost compared to rivals.

Absolute Advantage

The capability of a country, entity, or individual to produce a particular good or service more efficiently than others, using the same amount of resources.