New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Investigación de operaciones: Programación lineal

Yes or No

Played 0

About this activity

Conceptos y verdades sobre LP

Created by

Paraguay

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Investigación de operaciones: Programación lineal
 

Investigación de operaciones: Programación linealOnline version

Conceptos y verdades sobre LP

by Silvana Rafaela Ascurra de Calastra
1

Un problema de minimización en LP se puede convertir en maximización cambiando el signo de la función objetivo.

2

Las restricciones en programación lineal pueden ser no lineales.

3

La matriz de restricciones debe ser cuadrada.

4

El conjunto factible es el conjunto de soluciones que satisfacen todas las restricciones.

5

La programación lineal optimiza una función objetivo lineal sujeta a restricciones lineales.

6

Es necesario que todas las variables sean enteras.

7

Las variables de decisión en programación lineal suelen ser no negativas.

8

El método del simplex nunca requiere de variables artificiales.

9

La solución óptima de un problema de programación lineal suele ocurrir en un vértice de la región factible.

10

La solución óptima siempre es única.

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.