# Solution Library

# Rewriting Linear Programming Problem As Maximization Problem

**Question**

Rewrite the given linear programming problem as a maximization problem with constraints involving inequalities of the form ≤ (with the exception of the inequalities x ≥ 0, y ≥ 0)

Minimize C = 2x + 3y

Subject to x + y ≤ 9

x + 2y ≥ 10

4x + y ≥ 14

x ≥ 0, y ≥ 0

a. Minimize P = –2x – 3y

Subject to x + y ≤ 12

x – 2y ≤ –10

–4x + y ≤ –14

x ≥ 0, y ≥ 0

b. Minimize P = –2x – 3y

Subject to x + y ≤ 12

–x – 2y ≤ –10

–4x – y ≤ 14

x ≥ 0, y ≥ 0

c. Minimize P = –2x – 3y

Subject to x + y ≤ 12

–x + 2y ≤ 10

4x – y ≤ 14

x ≥ 0, y ≥ 0

d. Minimize P = –2x – 3y

Subject to x + y ≤ 12

–x – 2y ≤ –10

–4x – y ≤ –14

x ≥ 0, y ≥ 0

e. Minimize P = 2x + 3y

Subject to x + y ≤ 12

x – 2y ≤ –10

–4x – y ≤ –14

x ≥ 0, y ≥ 0**Summary**

The question belongs to Mathematics and it is about rewriting a linear programming problem as a maximization problem with constraints involving inequalities of the form ≤.**Total Word Count NA**

## Comments

Rashathis is a very good website

maaniI have 50 questions for the same test your page is showing only 28

joeannehi can you please help or guide me to answer my assignments. thanks

joeannehi can anyone help or guide me to my assignments. thanks

MonikCristinaThis solution is perfect ...thanks

JaneteHello Allison,I love the 2nd image that you did! I also, had never heard of SumoPaint, is something that I will have to exolpre a bit! I understand completely the 52 (or so) youtube videos that you probably watched. Sometimes they have what you want, sometimes they don't! However, it is always satisfying when you are able to produce something that you have taught yourself. Great job!Debra 0 likes

SandeepPerfect bank of solution.

Oxanagreat !

Paul Brandon-Fritziusthanks for the quick response. the solution looks good. :)

tina Johnsonthnx for the answer. it was perfect. just the way i wanted it.

Giuseppeworks fine.