# 3 multiple choice algebra questions

Anonymous
account_balance_wallet \$5

Question description

Linear programming

In a linear programming problem, the constraints represent the limitations on the situation, and the objective function is the function being maximized (or minimized). The constraints are inequalities, so a graph with all constraints shown on it will be a region, called the feasible region. The maximum or minimum value of the objective function will always happen at one of the vertices (corners) of the feasible region, so the corner points are the ones you need to check.Be sure you understand how to write constraints as well as an objective function for a real-world problem, such as one in which cost is minimized and profit is maximized. Be sure you understand how to test the vertices of the feasible region in the objective function to find the solution.

problems below

1.png
2.png

MohamedAbdo
School: Boston College

...

flag Report DMCA
Review

Anonymous
Outstanding Job!!!!

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors