Operations Research Asked on January 5, 2022

I have an optimization problem with an uncommon utility: to find a $beta$ that maximizes

$$

r^{T}cdot H(Xcdotbeta)

$$

where $H()$ is a Heaviside step function as in wiki

$r$ is a vector of size 1000

$X$ is a 1000×50 "tall" matrix

$beta$ is a vector of size 50

I am familiar with gradient descent, which is how I usually solve an optimization problem. But Heaviside function does not work with gradient descent. So I am wondering if anyone here could shed some light on how to solve such optimization problem.

You can solve the problem via integer linear programming as follows, assuming $r_i ge 0$ for all $i$. Let $M_i$ be a (small) upper bound on $-(X cdot beta)_i$. Let binary decision variable $y_i$ indicate whether $(X cdot beta)_i ge 0$. The problem is to maximize $$sum_{i=1}^{1000} r_i y_i$$ subject to $$-(X cdot beta)_i le M_i(1 - y_i)$$ for all $i$. This "big-M" constraint enforces $y_i=1 implies (X cdot beta)_i ge 0$.

Answered by RobPratt on January 5, 2022

1 Asked on August 19, 2021

1 Asked on August 19, 2021

1 Asked on August 19, 2021 by antarctica

2 Asked on August 19, 2021 by qinqinxiaoguai

6 Asked on March 1, 2021 by rajya

integer programming linearization nonlinear programming quadratic programming

1 Asked on March 1, 2021 by windbreeze

1 Asked on February 18, 2021 by dspinfinity

0 Asked on February 18, 2021 by yue-chao

1 Asked on February 15, 2021 by user152503

1 Asked on January 18, 2021

linear programming linearization logical constraints mixed integer programming

0 Asked on January 18, 2021 by amedeo

0 Asked on January 15, 2021 by robert-hildebrand

integer programming optimization scheduling simulated annealing solver

3 Asked on January 11, 2021 by stevgates

1 Asked on January 8, 2021 by fathese

1 Asked on December 22, 2020 by che

binary variable linear programming linearization logical constraints mixed integer programming

1 Asked on December 13, 2020 by high-gpa

3 Asked on November 28, 2020 by joffrey-l

1 Asked on September 25, 2020 by independentvariable

convex optimization convexity nonconvex programming probability distributions

Get help from others!

Recent Questions

- Iv’e designed a space elevator using a series of lasers. do you know anybody i could submit the designs too that could manufacture the concept and put it to use
- Need help finding a book. Female OP protagonist, magic
- Why is the WWF pending games (“Your turn”) area replaced w/ a column of “Bonus & Reward”gift boxes?
- Does Google Analytics track 404 page responses as valid page views?
- Why fry rice before boiling?

Recent Answers

- Peter Machado on Why fry rice before boiling?
- Lex on Does Google Analytics track 404 page responses as valid page views?
- Jon Church on Why fry rice before boiling?
- Joshua Engel on Why fry rice before boiling?
- haakon.io on Why fry rice before boiling?

© 2022 AnswerBun.com. All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP