60 likes | 182 Vues
This document outlines a step-by-step guide for finding the feasible region in linear programming problems using graphical methods. It covers the identification of constraints, labeling the feasible region, and finding the vertices of that region. It provides detailed instructions for selecting coordinates within feasible spaces and testing them against constraints to confirm correctness. The guide also includes a systematic approach to record the coordinates of vertices in a tabular format, preparing for optimization steps.
E N D
Ex12:02 Green Sigma Q1-4 • Plot constraints • Find feasible region • Label • Find vertices • Tabulate
Q1 Find the feasible region…
Q2 Find the feasible region… Have a think about which spaces could be feasible Choose a coordinate WITHIN each of those spaces Test them against the constraints When ALL the statements are correct you have found the feasible region. label it and the vertices Feasible region Coordinate selected = (2.5, 2)
Q2 To find each vertex we need to • Identify the 2 lines that make the vertex • Select them in ISCT solving function in the Graphics calculator ( under G-SLV) • Record the coordinates in a table ready for optimising. A Feasible region D B C
Q3 Find the feasible region…
Q4 Find the feasible region…