BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Apparently simple LP problem

Expert replies
by RiccardoBiemmi » Mon Oct 10, 2022 6:28 pm

Timer

00:00

Answers

A

B

C

D

E

Stats

Difficulty

Hi everybody,
I have a linear programming problem to solve that is very simple, except one aspect that is driving me nuts.

GOAL: maximize the gain of a set of devices.
I have an inventory of parts, which are used to build devices of different types. Note: only one device per type can be build. And, until here, all nice and clean.

What I am struggling to model is that the devices can only be built in a specific order.
For example, if I have DEV1, DEV2 and DEV3 that haven't be built already, I can only build DEV2 after building DEV1 and DEV3 only after building DEV1 and DEV2.

I thought to split the optimization and run it for all the "first" devices that haven't been built, see what the solver says, mark them as built and iterate until the inventory is empty, but I have the feeling this will almost always give me a very much sub-optimal solution.

Any idea?
Many thanks in advance,
Riccardo
Join the discussion
Source: — Problem Solving |