Mathematics Linear Programmig Problem

Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8), and (0, 5).

Let F = 4x + 6y be the objective function.

Maximum of F – Minimum of F =

1
60
2
48
3
42
4
18

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters